#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef vector<ll> vi;
typedef vector<long long> vii;
typedef vector<vector<ll> > vvi;
typedef vector<vector<long long> > vvii;
typedef pair<ll,ll> pi;
typedef pair<long long ,long long> pii;
typedef vector<pair<ll,ll> > vpi;
typedef vector<pair<long long ,long long> > vpii;

#define boost std::ios::sync_with_stdio(false);cin.tie(0);cout.tie(0)
#define FOR(i,a,b) for(i= (a) ; i<(b); ++i)
#define pb push_back
#define mp make_pair
#define all(x) (x).begin() , (x).end()
#define out(x) cout<<x<<"\n"
#define sz(x)  (x).size()
#define nl cout<<"\n"
#define INF 1e18
#define F first
#define S second

const ll mod = 1e9+7;

map<ll,ll> cnt;

ll solve(ll n)
{
    if(n==1)
        return 1;
    if(n==2) return 3;
    if(n==3) return 4;
    if(cnt.find(n)!=cnt.end())
        return cnt[n];
    ll i,ans=1, largest=1, z, copy=n;
    bool ok=0;
    while (n%2 == 0)
    {
        ok=1;
        n = n/2;
    }
    vii prime;
    if(ok) prime.pb(2);
    for (i = 3; i*i <= n ; i = i+2)
    {
        ok=0;
        while (n%i == 0)
        {
            ok=1;
            n = n/i;
        }
        if(ok) prime.pb(i);
    }
    if (n > 2){
        prime.pb(n);
    }
    ll tmp=0, rem=-1;
    FOR(i,0,(ll)prime.size())
    {
        ll p = prime[i];
        z = solve(copy/p);
        if(p*z > tmp){
            tmp = max(tmp,p*z);
            rem=p;
        }
    }
    // z = solve(copy/largest);
    // ans+=largest*z;
    ans += tmp; 
    // cout<<"n = "<<copy<<" optimal - "<<rem<< " ans = "<<ans;nl;
    return cnt[copy]=ans;
}
int main() 
{
    boost;
    ll n,m,i,j,k,z;
    cin>>n;
    vii a(n);
    FOR(i,0,n) cin>>a[i];
    ll ans=0;
    FOR(i,0,n)
        ans+=solve(a[i]);
    out(ans);
    return 0;
}