#include <bits/stdc++.h>

using namespace std;
#define MAX 1000006

vector<long> V(MAX,0);
bool fl[MAX]={0};
vector<int> primes;

void find_primes()
{
    int i,j;
    for(i =2;i < MAX ; i++)
    {
        if(fl[i]==0)
        {
            primes.push_back(i);
            for(j=2;i*j<MAX;j++)
                fl[i*j]=1;
        }
    }
}

long find_largest_prime(long val)
{
    int i=0;
    while(i<primes.size() && primes[i]<val)
    {
        if(val%primes[i]==0)
        {
            val/=primes[i];
            
        }
        else
            i++;
    }
    return val;
}

long rec(long val)
{
    
    if (val==1)
        return 1;
    if(val< MAX && V[val]!=0)
        return V[val];
    
    long max_val=1+val;
    
    long pr = find_largest_prime(val);
    max_val=1+((pr)*rec(val/pr));
  /*  for(int i=0; primes[i]<val && i < primes.size() ;i++)
    {
        if(val%primes[i]==0)
        {
            max_val= max(max_val,(1+((val/primes[i])*rec(primes[i]))));
            max_val= max(max_val,(1+((primes[i])*rec(val/primes[i]))));
        }
    }
    */
    if(val<MAX)
        V[val]=max_val;
    return max_val;
}

long longestSequence(vector <long> a) {
    //  Return the length of the longest possible sequence of moves.
    long sum=0;
    for(auto n:a)
  //  for(long n=2;n<40;n++)
    {
   //     cout<<n << ' '<<find_largest_prime(n)<<endl;
        sum+=rec(n);
    }
    
    return sum;
}

int main() {
    int n;
    cin >> n;
    vector<long> a(n);
    for(int a_i = 0; a_i < n; a_i++){
       cin >> a[a_i];
    }
    find_primes();
    long result = longestSequence(a);
    cout << result << endl;
    
    return 0;
}