#include <bits/stdc++.h>
#define ll long long
#define pb push_back
using namespace std;

 vector<ll> v;
 vector<long> a;
void SieveOfEratosthenes(int n=1000000)
{ bool prime[1000001];

    memset(prime, true, sizeof(prime));

    for (ll p=2; p<=n; p++)
    {
        if (prime[p] == true)
        {     v.pb(p);
            // Update all multiples of p
            for (ll i=p*2; i<=n; i += p)
                prime[i] = false;
        }
    }
 
   
}

ll longestSequence() {
    //  Return the length of the longest possible sequence of moves.
   ll r = 0ll;
    
   for(int i=0; i<a.size(); i++)
   {
       ll x = a[i];
       r += x;
       
          for (int j=0; j<v.size() && v[j]*v[j]<=x; j++)
           {
                
              if(x%v[j]==0)
               {
                   ll m= x/v[j];
                   r += m;
                   x = m;
                  j--;
               }    


           }
        if(x!=1) r++;
       
       
           
       
   }    
    
   
    
    return r;
    
    
}

int main() {
    
   ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    
    int n;
    cin >> n;
     
    SieveOfEratosthenes();
    ll x;
    
    for(int a_i = 0; a_i < n; a_i++){
       cin>>x;
        a.pb(x);
        //cin >> a[a_i];
    }
    ll result = longestSequence();
   // cout<<v.size()-1;
   /// cout<<v[0]<<" ";
    cout << result << endl;
    return 0;
}