#include <bits/stdc++.h>
#include <cmath>

using namespace std;

long long sd(long long n)
{
    if (n % 2 == 0)
        return n/2;
 
    else{
        long long sr= floor(sqrt(n));
        //cout<<" sr "<<sr<<" ";
        for (long long i=3;i<=sr;i+=2)
            if(n%i==0)
                return n/i;       
         }
         return 1;
}

long long longestSequence(long long a[],long long n) {
    
    long long c=0,co=0,x,j,i,z;
    
    for(long long it=0;it<n;it++)
    {
        x=a[it];
        j=x;
        while(1)
        {
            i=sd(x);
            co=co+x;
            x=i;
            //cout<<x<<" ";
            
            if(x==1){
                if(j!=1)
                   co=co+x;
                
                break;
            }
        }
        
        c=c+co;
        co=0;
    }
    return c;
}

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