#include <bits/stdc++.h>

using namespace std;

long longestSequence(vector <long> a) 
{
    long vas = 0;
    for(int i = 0; i < a.size(); i++)
    {
        vector<long> at;
        long ct = 2;
        while(ct * ct <= a[i])
        {
            if(a[i] % ct == 0)
            {
                a[i] /= ct;
                at.push_back(ct);
                continue;
            }
            ct++;
        }
        if(a[i] > 1)
        {
            at.push_back(a[i]);
        }
        a[i] = 1;
        long vv = 1;
        vas++;
        for(int i = at.size() - 1; i >= 0; i--)
        {
            vv *= at[i];
            vas += vv;
        }
    }
    return vas;
}

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;
}