#include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
#include <cmath>
using namespace std;
#define N 1000009
#define LL long long

int n;
LL a[200];

bool sv[N];
vector<LL> pr;

void primes(){
    for(LL i=2; i<N; i++){
        if(sv[i]==false){
            pr.push_back(i);
            for(LL j=i*i; j<N; j+=i){
                sv[j]=true;
            }
        }
    }
}

LL cc(LL len){
    vector< LL > cp;
    
    LL cur_len=len;
    LL sr_len = (LL)sqrt((long double)len);
    int i=0;
    
  //  cout<<"sr_len: "<<sr_len<<endl;
    
    while(i<pr.size() && pr[i]<=sr_len){
        while(cur_len%pr[i]==0){
            cp.push_back(pr[i]);
            cur_len/=pr[i];
        }
        i++;
    }
    if(cur_len>1){
        cp.push_back(cur_len);
    }
    
   // cout<<"prime size: "<<cp.size()<<endl;
    
    LL res=1;
    LL cur_mul=1;
    for(int i=cp.size()-1; i>=0; i--){
        cur_mul*=cp[i];
        res += cur_mul;
    }
    
    
    return res;
}

int main() {  
    cin>>n;
    for(int i=0; i<n; i++){
        cin>>a[i];
    }
    
    primes();
    
    LL res=0;
    
    for(int i=0; i<n; i++){
        res += cc(a[i]);
    }
    
    cout<<res<<endl;
 
    return 0;
}