#include <bits/stdc++.h>

using namespace std;
int prime(long long int f){
    int re=0;
    for(long long int i=2;i<f;i++){
        if(f%i==0){re=1;}
    }
    if(re==1){return 0;}//composite
    else{return 1;}
}
long long int lcf(long long int g){
    long long int kum;
    if(prime(g)==0){
    for(long long int i=2;i<g;i++){
        if(g%i==0){kum=i;break;}
        else{kum=0;}
    }}
    if(prime(g)==1){kum=0;}
    return kum;
}

long long int longestSequence(vector <long long int> a) {
    //  Return the length of the longest possible sequence of moves.
    int nu = a.size();
    long long int sum=0,temp,temp1;
    for(int i=0; i<nu;i++){
        if(a[i]==1){sum+=1;}
        if(prime(a[i])==1){sum+=a[i]+1;}
        for(long long int j=10;j>0;j++){
            if(j==10){temp=a[i];}
            
            if(lcf(temp)==0){sum+=temp1*(temp+1);break;}
            
            sum++;
            temp1=temp/lcf(temp);
            temp=lcf(temp);
            
        }
    }
    return sum;
}

int main() {
    int n;
    cin >> n;
    vector<long long int> a(n);
    for(int a_i = 0; a_i < n; a_i++){
       cin >> a[a_i];
    }
    long long int result = longestSequence(a);
    cout << result << endl;
    return 0;
}