#include <iostream>
#include <algorithm>
#include <cmath>
#include <vector>

#define pb push_back
using namespace std;

vector <long long> vec;
vector <long long> v;

long long primeFactors(long long n)
{
   if(n==1)
   return 1;
    while (n%2 == 0){
    	v.pb(2);
        n = n/2;
    }
 

    for (long long i = 3; i <= sqrt(n); i = i+2){
        while (n%i == 0){
        	v.pb(i);
            n = n/i;
        }
    }
 

    if (n > 2)
    v.pb(n);
    
    reverse(v.begin(),v.end());
    long long ans=1+v[0];
	long long x=v[0];
    
    for(long long i=1;i<v.size();i++){
    	ans+=x*v[i];
    	x*=v[i];
	}
    
	v.clear();
	return ans;
}
 

int main()
{
	
    int n;
    cin>>n;
    for(int i=0;i<n;i++){
    	long long x;
    	cin>>x;
    	vec.pb(x);
	}
	long long res=0;
	for(int i=0;i<n;i++){
    res+=primeFactors(vec[i]);
   }
cout<<res<<endl;
    return 0;
}