#include <bits/stdc++.h>

using namespace std;

long long longestSequence(vector <long long> a) {
    long long res,n,ans=0,k,flag;
    //  Return the length of the longest possible sequence of moves.
   
    for(long long i=0;i<a.size();i++)
    {
        n = a[i];
        res = a[i];
       //cout<<"arr:"<<a[i]<<" ";
        flag =0;
           if(a[i]==1)
            res = 1;
        
        else
        {
           //cout<<a[i]<<" ";
            k = sqrt(a[i]);
            k++;
            for(long long j=2;j<=k;j++)
            {
                //if(a[i]<j)
                    //break;
                if(a[i]%j == 0)
                {
                    a[i]/=j;
                    res = res + a[i];
                   
                    //cout<<res<<endl;
                    j=1;
                }
            }
            if(a[i]!=1)
                res += 1;
            
        }
        
       //cout<<"res:"<<res<<endl; 
       ans += res;
        
    }
    
    //cout<<ans<<" ";
      
    return ans;
}

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