#include <bits/stdc++.h>

using namespace std;

long longestSequence(vector <long> a) {
    int m=a.size();
    long s=0;
    for(int i=0;i<m;i++) s+=a[i];
    
    for(int i=0;i<m;i++){
     if(a[i]==1) continue;   
 	vector<long> v;
        long x=a[i];
	for(long j=2;j*j<=x;j++){
		while(x%j==0){
			v.push_back(j);
			x/=j;
		}
	}

	if(x!=1) v.push_back(x);
        
        sort(v.begin(),v.end());
        reverse(v.begin(),v.end());
        
        int N=v.size();
        long p=1;
        s++;
        for(int j=0;j<N-1;j++){
            p*=v[j];
            s+=p;
        }
    }
        return s;
             
    
}

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