#include <bits/stdc++.h>

using namespace std;
typedef unsigned long long int ulli;


ulli longestSequence(vector <ulli> a) {
    //  Return the length of the longest possible sequence of moves.
    ulli i11,fact, res1=0, res11, moves_n_level=1,a_temp;
    vector <ulli>::iterator i1;
    for(i1=a.begin(); i1 !=a.end(); i1++)
    {
        res11=(*(i1) !=1)?1:0;
        a_temp=*i1;
        //cout<<"a_temp "<<a_temp<<"\n";
        moves_n_level=1;
        fact=a_temp;

        while(a_temp>1 && fact!=1)
        {
             i11=sqrt(a_temp);
             //cout<<i11<<"\n";
             for(; (i11>=1 && fact!=1); i11--)
             {
                  if(a_temp%i11==0)//finding largest factor of a_temp
                    {

                        fact=i11;
                        a_temp/=i11;
                        moves_n_level*=i11;
                        res11+=moves_n_level;
                        //cout<<"\nfactor="<<i11<<" (moves "<<moves_n_level<<", res "<<res11<<")\n";

                        //cout<<a_temp<<"\n";
                        i11=0;//condition to break out of the loop
                        break;

                    }
                    //else cout<<"not factor"<<i11<<"...";
             }

        }

        res1+=res11+ *(i1);
        //cout<<"res1 "<<res1<<"\n";

    }
    return res1;

}

int main() {
    //freopen("WorldCodeSprint12.txt","r",stdin);//redirects standard input
    //freopen("out.txt","w",stdout);//redirects standard output
    int n;
    cin >> n;
    vector<ulli > a(n);
    for(int a_i = 0; a_i < n; a_i++){
       cin >> a[a_i];
       //cout<< a[a_i]<<" ";
    }
    //cout<<"\n";

    ulli  result = longestSequence(a);
    cout << result << endl;
    return 0;
}