#include <bits/stdc++.h>
using namespace std;
map<long long,long long>dp;
long long m;
long long func(long long n,long long res,long long prev)
{
   // cout<<n<<" "<<res<<" "<<prev<<endl;
    if(n<=1)
    {
        return res;
    }
    long long sq = sqrt(n*1.);
    long long mx = 0;
    for(long long i=sq; i>=1; i--)
    {
        if(i==1)
        {
            long long val = func(1,res+(prev*n),prev*n);
            mx = max(val,mx);
        }
        else if(n%i==0)
        {
            //cout<<n<<" "<<res<<" "<<prev<<" "<<i<<endl;
            long long a = n/i;
            long long val = max(func(n/i,res+(prev*i),prev*i),func(n/a,res+(prev*a),prev*a));
            mx = max(val,mx);
        }
    }
    return mx;
}
int main()
{
    int l;
    long long sum=0;
    scanf("%d",&l);
    while(l--)
    {
        scanf("%lld",&m);
        sum+=func(m,1,1);
    }
    printf("%lld\n",sum);
}