#include <bits/stdc++.h>
using namespace std;
int n;
bool IsPrime[1000001];
long long Pri[2000001],a;int PriN=0;
long long result(long long x){
    if(x==1)return 1;
    long long as=x,cx=x;
    for(int i=0;i<PriN&&Pri[i]<=cx;++i){
    	long long c=Pri[i];
        while(x%c==0){
            as+=x/c;
            x/=c;
        }
    }
    if(x!=1)as++;
    return as;
}
int main() {
    scanf("%d",&n);
    memset(IsPrime,true,sizeof(IsPrime));
    for(int i=2;i<=1000000;++i){
        if(IsPrime[i])Pri[PriN++]=(long long)i;
        for(int j=0;j<PriN;++j){
            if(i*Pri[j]>1000000)break;
            IsPrime[i*Pri[j]]=0;
            if(i%Pri[j]==0) break;
        }
    }
    long long ans=0;
    for(int i=1;i<=n;i++){
	    scanf("%lld",&a);
        ans+=result(a);
    }
    cout<<ans<<endl;
    return 0;
}