#include <bits/stdc++.h>

using namespace std;
int prime[1000000];
long dp[1000000];
long longestSequence(vector <long> a) {
    
    long i,j;
    long max1=a[0];
    for(i=1;i<a.size();i++)
    {
        if(a[i]>max1)
            max1=a[i];
    }
	memset(prime,0,sizeof(prime));
	prime[0]=prime[1]=1;
	for(i=2;i*i<=max1;i++)
	{
		if(prime[i]==0)
		{
			for(j=2*i;j<=max1;j+=i)
			{	
				if(prime[j]==0)
					prime[j]=1;
			}
		}
    }
    dp[1]=1;
    dp[2]=3;
    for(i=3;i<=max1;i++)
    {
        if(prime[i]==0)
            dp[i]=i+1;
        else
        {
            int flag=0;
            for(j=2;j<i;j++)
            {
                if(i%j==0)
                {
                    if(flag==0){
                        dp[i]=1+(i/j)*dp[j];
                        flag=1;
                    }
                    else
                        dp[i]=max(dp[i],1+(i/j)*dp[j]);
                }
            }
        }
    }
    long ans=0;
    for(i=0;i<a.size();i++)
        ans+=dp[a[i]];
    return ans;
    
	
    
    
    //  Return the length of the longest possible sequence of moves.
}

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;
}