#include <bits/stdc++.h>

using namespace std;
bool is_prime(unsigned long long int n) {
   
    if (n == 1) {
        return false;
    }

    unsigned long long int i = 2;
   
    while (i*i <= n) {
    
        if (n % i == 0) {
         
            return false;
        }
        i += 1;
    }
 
    return true;
}
void primeFactors(unsigned long long int n,vector<unsigned long long int> &v)
{
     
    while (n%2 == 0)
    {
        v.push_back(2);
        n = n/2;
    }
 
    for (unsigned long long int i = 3; i <= sqrt(n); i = i+2)
    {
       
        while (n%i == 0)
        {
           v.push_back(i);
            n = n/i;
        }
    }
 
   
    if (n > 2)
        v.push_back(n);
    sort(v.begin(),v.end());
    v.erase( unique( v.begin(), v.end() ), v.end() );
}
unsigned long long int longestSequence(vector <unsigned long long int> a) {
   unsigned long long int sum=0;
    for(int i=0;i<a.size();i++){
       
        while(true){
            if(a[i]%2==0){
                sum+=a[i];
                a[i]/=2;
            }
            else{
                if(a[i]==1){
                    sum+=1;break;
                }
                else{
                if(is_prime(a[i])){
                    sum+=a[i]+1;break;
                }
                else{
                    vector<unsigned long long int> v;
                   sum+=a[i];
                    primeFactors(a[i],v);
                    for(int j=0;j<v.size();j++){
                        if(a[i]%v[j]==0){a[i]/=v[j];break;}
                    }
                    
                }
                }
            }
        }
    }
    return sum;
    //  Return the length of the longest possible sequence of moves.
}

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