#include <bits/stdc++.h>

using namespace std;

long long longestSequence(vector <long long> a) {
   long long k,j,i,n,ans=0;
    for(i=0;i<a.size();i++)
    {
        k=a[i];
        ans+=k;
        while(k%2==0)
        {
            k/=2;
            ans+=k;
        }
        while(k%3==0)
        {
            k/=3;
            ans+=k;
        }
        n=sqrt(k);
        for(j=5;j<=n;j+=6)
        {
            while(k%j==0)
            {
                k/=j;
                ans+=k;
            }
            while(k%(j+2)==0)
            {
                k/=(j+2);
                ans+=k;
            }
        }
        if(k>1)
        {
            ans++;
        }
     // cout<<ans<<endl;
    }
    return ans;
    //  Return the length of the longest possible sequence of moves.
}

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