#include<bits/stdc++.h>
using namespace std;
#define vi vector<int>
#define pb push_back
#define mp make_pair
#define SIZE 1000005
typedef long long ll;
vi primes;
bitset<1000010> b;

void sieve()
{
	b.set();
	b[0]=b[1]=0;
	for(long i=2;i<=SIZE;i+=2)
	{
		if(b[i])
		{
			for(long j=2*i;j<=SIZE;j+=i)
				b[j]=0;
			primes.pb(i);
		}
		if(!(i&1))
			i--;
	}
}

int main() {
    sieve();
    int n;
    cin >> n;
    ll ans = 0,a,piece,move;  
    while(n--)
    {
        piece = 1;
        move = 0;
        cin >> a;
        int i=0,s=primes.size();
        map<long,long> um;
        while(a!=1 and i<s)
        {
            while(a%primes[i]==0 and a!=1)
            {
                /*a = primes[i];
                move += piece;
                piece *= a;*/
                a/=primes[i];
                if(um.find(primes[i]) == um.end())
                    um.insert(mp(primes[i],1));
                else
                    um[primes[i]]++;
            }
            i++;
        }
        if(a!=1)
            um.insert(mp(a,1));
        for(auto it = um.rbegin(); it!=um.rend(); it++)
        {
            i = it->second;
            while(i--)
            {
                move += piece;
                piece *= it->first;
                //cout<<move<<" "<<piece<<endl;
            }
        }
        move+=piece;
        ans += move;
    }
    cout<<ans;
    
    return 0;
}