#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll longestSequence(vector <ll> a) {
    ll ans =0;
    for(auto num : a){
        ll b = num;
        vector<ll> vb;
        while(b%2==0){
            vb.push_back(2);
            b/=2;
        }
        for(ll i=3; i*i<=b; i+=2){
            while(b%i==0){
                vb.push_back(i);
                b/=i;
            }
        }
        if(b>2){
            vb.push_back(b);
        }
        bool ok = true;
        if(num==1 || vb[vb.size()-1]==num){
            ok = false;
        }
        vb.push_back(1);
        reverse(vb.begin(), vb.end());
        
        ll r = 1, sum=0, sumant=0;
        for(int k=0; ok && k<vb.size()-1; k++){
            r*=vb[k];
            //cout<<vb[k]<<" "<<r<<" - ";
            //if(k>=1){
                sum+=r;
            //}
            sumant=r;
        }
        if(num>1 && vb.size()<=2)sum++;
        sum+=num;
        ans+=sum;
    }
    
    return ans;
}

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