#include <bits/stdc++.h>

using namespace std;

long longestSequence(vector <long> a) {
    //  Return the length of the longest possible sequence of moves.
    int len = a.size();
    
    
    long ans  = 0;
    
    for(int i=0;i<len;i++){
        
        long counter = 1;
        int f = 1;
        //cout<<ans<<"\n";
        while(f){
            
            if(a[i]==1){
                
                ans += counter;
                f = 0;
                break;
            }else{
                
                long check = sqrt(a[i]);
                long div = -1;
                for(long j=2;j<=check;j++)
                    if(a[i]%j==0){
                        div = j;
                        break;
                    }
                if((a[i] /div)%2)
                    div = a[i]/div;
                
                
                
                if(div==-1){
                    
                    ans += counter;
                    counter = counter * a[i];
                    a[i] = 1;
                }else{
                    
                    ans += counter;
                    a[i] = a[i] / div;
                    counter *= div;
                    
                    
                }
                
            }
            
        }
        
        
    }
    return ans;
    
}

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