#include <bits/stdc++.h>

using namespace std;

typedef long long int ll;

ll largestPrimeDivisor(ll n)
{

    ll max=1;
    ll prime=1;

    for (ll i = 2; i <= n/2; i++)
    {

        if (n%i == 0)
        {
            prime=i;
           // n = n/i;
        }

        if(max<prime)
            max=prime;
    }

    return max;
}



ll llestSequence(vector <ll> a) {
    //  Return the length of the llest possible sequence of moves.
    
    ll tsum=0;
    for(ll i=0;i<a.size();i++)
        {
           ll isum=1;
           ll temp=a[i];
            while(temp >1)
            { ll p;
                p=largestPrimeDivisor(temp);
               isum+=p;
              temp=temp/p;
              if(temp==2) 
              {  isum+=a[i];
                break;
              }
            }
                
           tsum+=isum;
        }
    return tsum;
}

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