#include <bits/stdc++.h>

using namespace std;
void mx(long n,long pieces,long &mp,long cp){
    
    
    if(n==2)
    {
        long t = cp+pieces+2*pieces;
        mp = max(mp,t);
        return;
    }
    
    int f=1;
    for(long i=n/2;i>=2;i--)
    {  if(n%i==0)
        {   f=0;
            mx(i,pieces*(n/i),mp,cp+pieces);
        }
    }
    
    if(f&&n%2)
    {    //cout<<"\n n = "<<n;
        long t = (n+1)*pieces + cp;
        //cout<<"\n t "<<t;
        mp = max(mp,t);
        return;
    }
    
    
}
long find(long x)
{   if(x==1)
    return x;
    long g=0;
    mx(x, 1, g, 0);
    return g;
}
long longestSequence(vector <long> a) {
    long c=0;
    for(long h:a)
        c+=find(h);
    return c;
}
 
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;
}