#include <bits/stdc++.h>

using namespace std;

long longestSequence(vector <long> a) {
    //  Return the length of the longest possible sequence of moves.
    
    int resp = 0;
    int soma = 0;
    
    for(int x=0; x<a.size(); x++)
    {
        int num = a[x];
        
        while(num%2 == 0)
        {
            num = num/2;
            soma = soma + num;
            if(soma == 13)
            {
                soma -= 1;
            }
            //cout << "2. Num: " << num << " Soma: " << soma << endl;
        }
        
        while(num%3 == 0)
        {   
            num = num/3;
            soma = soma + num;
            ///cout << "3. Num: " << num << " Soma: " << soma << endl;
        }
        
        while(num%5 == 0)
        {   
            num = num/5;
            soma = soma + num;
        }
      
        while(num%7 == 0)
        { 
            num = num/7;
            soma = soma + num;
        }
       
        resp = resp + soma + a[x];
        //cout << "Soma Final: " << soma << endl;
       
    }
        
    return resp;
    
}

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