#include <bits/stdc++.h>

using namespace std;

vector<long long>primes(1000001), red(1000001);

long long longestSequence(vector <long long> a) {
    long long ans=0,tmp;
    int j=0;
    for(int i=0;i<a.size();i++){
        tmp = a[i];j=0;
        if(tmp==1){
            ans+=1;
        }
        else{
            while(tmp>1){
                if(red[j]){
                    if(tmp%red[j]){
                        j++;
                    }
                    else{
                        ans+=tmp;
                        tmp/=red[j];
                    }
                }
                else{
                    ans+=tmp;
                    tmp=1;
                }
            }
            ans+=tmp;
        }
    }
    return ans;
    //  Return the length of the longest possible sequence of moves.
}

int main() {
    int n;
    cin >> n;
    vector<long long> a(n);
    
    for(int a_i = 0; a_i < n; a_i++){
       cin >> a[a_i];
    }
    
    for (int i = 2; i <= 1000000; i++) {
		if (!primes[i]) {
			for (int j = i << 1; j <= 1000000; j += i)
				primes[j] = 1;
		}
	}

	int j = 0;
	for (int i = 2; i <= 1000000; i++) {
		if (!primes[i]) {
			red[j] = i;
			j++;
		}
	}
    
    long long result = longestSequence(a);
    cout << result << endl;
    return 0;
}