/*
			 written by vishal choudhary
			 email id vishal130.vk@gmail.com
			 at Fri Dec 15 19:32:57 IST 2017 
*/
#include<bits/stdc++.h>
using namespace std;
#define lli long long  int
#define ulli unsigned long long  int
#define ll long long 
#define ull  unsigned long long  
#define mp make_pair
#define s(n)   scanf("%d",&n)
#define sc(n)  scanf("%c",&n)
#define sl(n)  scanf("%lld",&n)
#define sf(n)  scanf("%lf",&n)
#define ss(n)  scanf("%s",n)
#define p(n)   printf("%d",n)
#define pc(n)  printf("%c",n)
#define pl(n)  printf("%lld",n)
#define pf(n)  printf("%lf",n)
#define ps(n)  printf("%s",n)
#define pn printf("\n")
#define space printf(" ")
#define loopf(X,Y) for(int i=X;i<Y;i++)
#define loopb(X,Y) for(int i=X;i>Y;i--)
#define dout(X) if(X)
const lli  MAX_SIZE = 1000001;
vector<lli>isprime(MAX_SIZE , true);
vector<lli>prime;
vector<lli>SPF(MAX_SIZE);
void pussy__seive(int N){
    isprime[0] = isprime[1] = false ;
    for (lli i=2; i<N ; i++){
        if (isprime[i]){
            prime.push_back(i);
            SPF[i] = i;
        }
        for (lli j=0; j < (int)prime.size() && i*prime[j] < N && prime[j] <= SPF[i];j++){
            isprime[i*prime[j]]=false;
            SPF[i*prime[j]] = prime[j] ;
        }
    }
}
int main(){
    int N = 1000000,t,idx=0;
    lli n,mul,ans,*a,final_ans=0;
    pussy__seive(N);
    vector<lli> factor;
    s(t);
    a=new lli[t];
    for(int i=0;i<t;i++)
            sl(a[i]);
    for(int i=0;i<t;i++){
            n=a[i],idx=0;
            ans=mul=n;
            while(n!=1){
                    if(!(n%prime[idx])){
                            factor.push_back(prime[idx]);
                            n=n/prime[idx];
                    }
                    else {
                            idx++; 
                        if(idx==prime.size()){
                                     if(!factor.size()) ans=1+n;
                                     else  factor.push_back(n);
                                     break;
                        }

                            idx%=prime.size();
                    }
            }
            for(int j=0;j<factor.size();j++){
                    ans=ans+mul/factor[j];
                    mul=mul/factor[j];
            }
            factor.clear();
            final_ans+=ans;
    }
    pl(final_ans),pn;
    return 0;
}