#include <bits/stdc++.h>
using namespace std;
#define rep(i, x, y) for(ll i = (x); i <= (y); ++i)
#define bug(a) cout << #a << " = " << a << endl;
#define fbug(a, x, y) { cout << #a << ": "; rep(i, x, y) cout << a[i] << ' '; cout << endl; }
#define pb push_back
//#define mp make_pair
#define endd "\n"
#define fast ios::sync_with_stdio(false);cin.tie(0);cout.tie(0)
#define input freopen("inp.txt","r",stdin)
#define output freopen("out1.txt","w",stdout)
#define loop(i,n) for(ll i=0;i<n;i++)
#define rloop(i,n) for(ll i=n-1;i>=0;i--)
#define ll long long
#define Z size()
#define pii pair<int,int>
#define setp(x) fixed<<setprecision(x)
#define ff first
#define ss second
#define all(x) x.begin(),x.end()
#define pi 3.14159265358979323846264338327950288419716939937510
#define mset(x) memset(x,0,sizeof x);
#define spa cout<<endd
#define com(x)#x
#define mp make_pair
//#define modexp
#define inf 2000
#ifdef modexp
ll power(ll a , ll b,ll modi)
{
    ll res = 1 ;
    while(b)
    {
        if(b%2) {
            res = (res * a) % modi ;
        }
        b/=2 ;
        a = (a*a) % modi ;
    }
    return res ;
}
#endif
int dirx[] = { -1, -1, -1, 0, 0, 1, 1, 1 };
int diry[] = { -1, 0, 1, -1, 1, -1, 0, 1 };
//*******************************TEMPLATE ENDS HERE *******************//

ll primes[1000007];
bool p[1000007];
int siz=0;
void sieve(){
    
    for(int i=2;i*i<=1000004;i++){
        if(!p[i]){
            for(int j=2*i;j<1000004;j+=i)p[j]=1;
        }
    }
    
    for(int i=2;i<=1000004;i++){
        if(!p[i]){
            primes[siz++]=i;
           // if(i<100)cout<<i<<" ";
        }
    }
}
int n;
ll ar[101];
int main(){
   // input;
    ll tans=0;
    sieve();
    cin>>n;
    loop(i,n)cin>>ar[i];
    loop(i,n){
        ll num=ar[i];
        int k=0;
        while(num>1 && siz>k){
            
            while((num%primes[k])==0){
                tans+=num;
                num/=primes[k];
            }
            k++;
        }
        tans+=num;
        if(num>1)tans++;

    }
    cout<<tans<<endd;

    



}