#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(mp.find(x)==mp.end())
    {
        if(isPrime(x))
        {
            mp.insert(pair<long long,long long>(x, x+1));
            return x+1;
        }
        else
        {
            long long number;
            long long maxValue = -1;
            for(long long i=1; i<=x/2 ; i++)
            {
                if(x%i == 0)
                {
                    int y = getMax(i);
                    long long nParts = x/i;
                    long long z = nParts * y;
                    if(z > maxValue )
                    {     
                        maxValue = z;
                    }
                }
            }     
            mp.insert(pair<long long,long long>(x, maxValue+1));
            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;
}