#include<bits/stdc++.h>
using namespace std;
#define sc(a) scanf("%d",&a)
#define pf(a) printf("%d",a)
#define sc1(a) scanf("%lld",&a)
#define pf1(a) printf("%lld",a)
#define sc2(a) scanf("%d %d",&a.first,&a.second)
#define br printf("\n")
#define sp printf(" ")
#define ll long long int
#define pb push_back
#define ff first
#define ss second
#define f(i,n) for(int i=0;i<n;i++)
#define f1(i,st,n) for(int i=st;i<n;i++)
#define f2(i,j,n,m) f(i,n) f(j,m)
#define fr(i,n) for(int i=n-1;i>=0;i--)
#define RESET(a,val) memset(a,val,sizeof(a))
#define mod 1000000007
#define mod1 1000000009
#define oo 1000000000
typedef vector<ll> vl;
typedef pair<ll,ll> pll;
typedef vector<pll> vll;
typedef vector<int> vi;
typedef pair<int,int> ii;
typedef vector<ii> vii;
map<ll,ll> mp;
int primes[2000000]={0};
vi vec;
ll bin(ll x){
    if(x<=1) return x;
    if(mp.find(x)!=mp.end()) return mp[x];
    ll mx = 1+x;
    f(i,vec.size()){
        if(x<=vec[i]) break;
        if(x%vec[i]==0){
     //       cout<<x<<" "<<vec[i]<<" "<<bin(vec[i])<<endl;
            mx = max(mx,(1+((vec[i])*bin(x/vec[i]))));
        }
               
    } 
    mp[x] = mx;
    return mx;
}
int main(){
    int n;
    cin>>n;
    primes[1] = primes[0] = 1;
    for(int i=2;i<=1000002;i++){
        if(primes[i]==0){
            for(int j=2*i;j<1000003;j = j+i)
                primes[j] = 1;
        }
    }
    f(i,1000002){
        if(primes[i]==0) vec.pb(i);
    }
    //cout<<" 3"<<primes[3]<<endl;
    mp.clear();
    ll a[n];
    f(i,n) {
        sc1(a[i]);
    }
    ll ans =0;
    sort(a,a+n);
    for(int i=n-1;i>=0;i--){
        ans+=bin(a[i]);
    }
    cout<<ans<<endl;
   // cout<<bin(7)<<endl;
   // cout<<bin(24)<<endl;
   // cout<<bin(12)<<endl;
   // cout<<bin(8)<<endl;
return 0;
}