#include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
using namespace std;

vector <int64_t> prime(1000000,1);
vector <int64_t> spf(1000000,-1);
vector <int64_t> primes;
void sieve(){
    prime[0]=0;
    prime[1]=0;
    spf[2]=2;
    primes.push_back(2);
    for(int64_t i=4;i<1000000;i+=2){
        prime[i]=0;
        spf[i]=2;
    }
    for(int64_t i=3;i<1000000;i+=2){
        if(prime[i]){
            primes.push_back(i);
            spf[i]=i;
            for(int64_t j=i*i;j<1000000;j+=i){
                prime[j]=0;
                if(spf[j]==-1){
                  spf[j]=i;  
                }         
            }
        }
    }
}


int main() {  
    sieve();
    int64_t n;
    cin >> n;
    vector <int64_t> a(n);
    for (int i = 0; i < n; i++) {
        cin >> a[i];
    }
  
    /* Enter your code here. Print output to STDOUT */  
    uint64_t ans=0;
    for(int i=0;i<n;i++){
        //cout<<a[i]<<endl;
        while(a[i]>1){
            while(a[i]>1 && a[i]%2==0){
                 ans+=a[i];
                 a[i]=a[i]/2;
                //cout<<a[i]<<endl;
            }
            if(a[i]!=1){
               // cout<<"here";
                if(a[i]>=1000000){
                    int f=0;
                    for(int j=0;j<primes.size();j++){
                        if(a[i]%primes[j]==0){
                            ans+=a[i];
                            a[i]=a[i]/primes[j];
                            
                            f=1;
                            break;
                        }
                    }
                    if(f==0){
                        ans+=a[i];
                        a[i]=1;
                    }
                   // cout<<a[i]<<endl;
                }
                else{
                    ans+=a[i];
                    a[i]=a[i]/spf[a[i]];
                    //cout<<a[i]<<endl;
                }
            }
        }
        ans+=1;
    }
    cout<<ans<<endl;
    return 0;
}