#include <bits/stdc++.h>

using namespace std;
long lpf(long n){
    long m=n,s;
    while(n%2==0){
        n=n/2;
    }
    if(n==1){
        s=2;
    }
    else{
        long r=0;
        long sq=sqrt(n);
        for(long i=3;i<=sq;i=i+2){
            while(n%i==0){
                n=n/i;
                r=i;
            }
        }
        if(n>2){
            s=n;
        }
        else{
            s=r;
        }
    }
    return s;
}
long find(long a){
    long n,s;
    n=lpf(a);
    if(a==1){
        s=1;
    }else{
    s=1+n*(find(a/n));
    }
    return s;
}
long longestSequence(vector <long> a) {
    long sum=0;
    for(int i=0;i<a.size();i++){
        sum=sum+find(a[i]);
    }
    return sum;
       //  Return the length of the longest possible sequence of moves.
}

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