#include<bits/stdc++.h>
#define all(v) v.begin(),v.end()
using namespace std;
typedef long long ll;
vector<int> prime;
void sieve(){

	int N=(int)1e6;
	bool *isp=new bool[N]();

	for(int z=2;z<=N;z++)
	{
		if(!isp[z])
		{
			prime.push_back(z);
			if(z*z>N)	continue;

			for(int j=2*z;j<=N;j+=z)
				isp[j]=true;
		}
	}

//	for(int i=0;i<prime.size();i++){
//        cout<< prime[i] << "\n";
//        if(prime[i]==0){
//            cout << "Areh bhai bhai bhai bhai\n";
//            break;
//        }
//	}
}
ll factorise(ll n){
	ll num=n;
	ll max_f=1;
	for(int i=0;i<prime.size() && prime[i]<=num;i++){

		int j = lower_bound(all(prime),num)-prime.begin();
    	if(j!=prime.size() && prime[j]==num){
    		return num;
		}

		int p=prime[i];
		if(num%p==0){
			while(num%p==0)
                num=num/p;
            if(p>max_f)
                max_f=p;
		}
	}
	if(num!=1 && num>max_f)
        max_f=num;

    return max_f;
}
int main(){

    int n;
    cin >> n;
    vector<ll> arr(n,0);
    for(int i=0;i<n;i++){
        cin >> arr[i];
    }
    sieve();
    ll count=0;
    for(int i=0;i<n;i++){
        count+=1;
        ll temp1=1;
        while(arr[i]!=1){
            ll temp = factorise(arr[i]);
            count+=(temp1*temp);
            if(temp!=0)
                arr[i]/=temp;
            temp1=temp*temp1;
        }
       // cout << count << "\n";
    }

    cout << count;
    return  0;
}