#include <bits/stdc++.h>

using namespace std;


vector <long> primes(long n){
    vector <long> t;
    while(n%2==0){
        t.push_back(2);
        n=n/2;
    }
    for (long i = 3; i <= sqrt(n); i = i+2)
    {
        while (n%i == 0)
        {
            t.push_back(i);
            n = n/i;
        }
    }
 
   
    if (n > 2)
        t.push_back(n);
    
    return t;
}

long longestSequence(vector <long> a) {
    long sum=0;
    //  Return the length of the longest possible sequence of moves.
    for(long i=0;i<a.size();i++){
        if(a[i]==1)
            sum=sum+1;
        else{
            vector <long> temp=primes(a[i]);
            long n=a[i];
            sum+=a[i];
            for(long i=0;i<temp.size();i++){
                  //cout<<temp[i]<<endl;
                  n=n/temp[i];
                  sum+=n;
            }
        }  
    }
    return sum;
}

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;
}