#include <bits/stdc++.h>

using namespace std;

bool cmp(long long int a,long long int b){
    return a>b;
}

vector<long long int> primes;
long long int p[1000006];

void sieve(){
    for(long long int i=2;i*i<1e12+5;i++)
        if(!p[i])
            for(long long int j=2*i;j<1000005;j+=i)
                p[j] = 1;
    for(long long int i=2;i<1000005;i++)
        if(!p[i])
            primes.push_back(i);
}

long long int foo(long long int x){
    vector<long long int> v;
    long long int ans = 1;
    long long int mul = 1;
    for(long long int  i=0;primes[i]<=x and i<primes.size();i++){
        while(x%primes[i]==0){
            v.push_back(primes[i]);
            x/=primes[i];
        }
    }
    if(x!=1) v.push_back(x);
    sort(v.begin(),v.end(),cmp);
    for(long long int i=0;i<v.size();i++){
        cerr<<v[i]<<' ';
        mul *= v[i];
        ans += mul;
    }
    cerr<<endl;
    return ans;
}

long long int longestSequence(vector <long long int > a) {
    long long int ans = 0;
    for(long long int i=0;i<a.size();i++){
        ans += foo(a[i]);
    }
    return ans;
}

int main() {
    sieve();
    int n;
    cin >> n;
    vector<long long int> a(n);
    for(long long int a_i = 0; a_i < n; a_i++){
       cin >> a[a_i];
    }
    long long int result = longestSequence(a);
    cout << result << endl;
    return 0;
}