#include <bits/stdc++.h>
using namespace std;
vector<long long>ve;
bool prime[5000005];
void Sieve()
{
    memset(prime, true, sizeof(prime));
    for (int p=2; p*p<=1e6; p++)
    {
        if (prime[p] == true)
        {
         
            for (int i=p*2; i<=1e6; i += p){
                prime[i] = false;
            }
        }
    }

    // Print all prime numbers
    for (int p=2; p<=1e6; p++)
       if (prime[p])
           ve.push_back(p);
          
}
int main(int argc, char const *argv[])
{
    Sieve();
	int n;
	cin>>n;
	long long int sum=0;
	for(int i=0;i<n;i++){
		long long int x;
		cin>>x;
        vector<long long>v;
        long long ans = 1;
        for(int i=0;i<ve.size()&&ve[i]<=x;i++){
            while(x%ve[i]==0){
                x/=ve[i];
                v.push_back(ve[i]);
            }
        }
        if(x>1){
            v.push_back(x);
        }
		sort(v.begin(), v.end());
        for(int i=v.size()-1;i>=0;i--){
            ans = ans*v[i];
            sum += ans;
        }
        sum++;
    }
    cout<<sum<<endl;

	return 0;
}