#include <bits/stdc++.h>
#include <tr1/unordered_map>
typedef long long ll;
typedef unsigned long long ull;
#define clr(ma) memset(ma,-1,sizeof ma)
#define INF 1000000000
#define vi vector<int>
#define pi pair<int ,int >
#define mk make_pair
#define getBit(m,i) ((m&(1ll<<i))==(1ll<<i))
#define setBit(m,i) (m|(1<<i))
#define setBit2(m,i) (m|(1ull<<i))
#define cont(i,ma) ((ma.find(i))!=(ma.end()))
#define in(i) scanf("%d",&i)
#define in2(i,j) scanf("%d%d",&i,&j)
#define in3(i,j,k) scanf("%d%d%d",&i,&j,&k)
#define in4(i,j,k,l) scanf("%d%d%d%d",&i,&j,&k,&l)
#define itr map<int,int>::iterator
#define itr2 set<int>::iterator
#define id(k) scanf("%9lf",&k)
#define fi(ss) freopen (ss,"r",stdin)
#define fo(ss) freopen (ss,"w",stdout)
#define sc(s) scanf("%s",s)
#define clean(vis)  memset(vis,0,sizeof vis)
#define  bitcount(x)  (__builtin_popcount(x))
#define rep0(x) for(int i=0;i<x;i++)
#define rep1(x) for (int i=1;i<x;i++)
using namespace std;
const int N=1000000+5;
unordered_map<ll,vector<ll> > f;
unordered_map<ll,ll> dp;
void  factors (ll n){
    if (f.count(n)) return;
    f[n]=vector<ll> ();
    vector<ll> & v=f[n];
    ll g=n;
    for (ll i=2;i*i<=n;i++){
        if (g%i==0){
            v.push_back(i);
            while (g%i==0)g/=i;
        }
    }
    if (g>1)v.push_back(g);

}
ll solve (ll n){
    if (n==1) return 1;
 if (dp.count(n))return dp[n];
    dp[n]=0;
    ll & res=dp[n];
    factors(n);
    int mx=0;
    vector<ll> & v = f[n];
    ll it = v.back();
//    for (auto it : v){
//        if (it==1)continue;
    //cout<<n<<" "<<v[1]<<endl;
    //   cout<<n<<" "<<it<<" ="<<solve(n/it)*it<<endl;
        res=max(res,solve(n/it)*it+1);
  // }
//    for (auto it : v){
//        if (it==1)continue;
//        //cout<<n<<" "<<v[1]<<endl;
//        cout<<n<<" "<<it<<" ="<<solve(n/it)*it<<endl;
//      //  res=max(res,solve(n/it)*it+1);
//    }
    return res;
}
int main (){
    int t;
    in(t);
    ll ans=0;
    while (t--){
        ll n;
        cin>>n;
        ans+=solve(n);
    }
    cout<<ans<<endl;
}