#include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
#include <map>
#include <utility>
using namespace std;

map <long long, long long> mp;


bool isPrime(long long x)
{
    for(long long i=2;i<=sqrt(x);i++)
    {
        if(x%i == 0)
            return false;
    }
    return true;
}
long long getMax(long long x)
{   
    if(x==0)return 0;
    if(mp.find(x)==mp.end())
    {
        if(isPrime(x))
        {
            mp.insert(pair<long long,long long>(x, x+1));
            //cout<<"inserting "<<x<<"\n";
            return x+1;
        }
        else
        {
            long long number;
            long long maxValue = -1;
            vector<long long > fac;
            for(long long i=2; i<=sqrt(x) ; i++)
            {
                if(x%i == 0)
                {
                    fac.push_back(i);
                    if(i != sqrt(x))
                        fac.push_back(x/i);
                }
            } 
            sort(fac.begin(), fac.end());
            for(long long i=0; i<fac.size() ; i++)
            {
                long long y = getMax(fac[i]);
                long long nParts = x/fac[i];
                long long z = nParts * y;
                if(z > maxValue )
                {     
                   number = fac[i];
                   maxValue = z;
                }
            }
            //cout<<number<<" ";
            mp.insert(pair<long long,long long>(x, maxValue+1));
            //cout<<"inserting "<<x<<"\n";
            return maxValue+1;
        }
    }
    else
    {
        pair<long long,long long> p = *mp.find(x);
        return p.second;
    }
    
}
int main() {  
    mp.insert(pair<long long,long long>(1, 1));
    int n;
    cin >> n;
   
    vector <long long> a(n);
    for (int i = 0; i < n; i++) {
        cin >> a[i];
    }
    long long sum =0;
    for(int i=0; i<n; i++)
    {   
        sum += getMax(a[i]);
        //cout<<getMax(a[i])<<" ";      
    }
    cout<<sum;
    return 0;
}