#include<map>
#include<iomanip>
#include<iostream>
#include<algorithm>
#include<cstdio>
#include<vector>
#include<cstring>
#include<string>
#include<math.h>
#include<sstream>
#include<cctype>
#include<set>
#include<queue>
#include<stack>
#include<ctime>
#include<cstdlib>
#include<cassert>
#include<utility>
#include<complex>
#include<bitset>
#include<complex>
#include<fstream>
#include<list>
using namespace std;
#define L long
#define LL long long
//#define double long double
#define LD long double
#define f first
#define s second
//#define x first
//#define y second
//#define G getchar_unlocked
#define mp make_pair
#define pb push_back
//#define pb(a,b) push_back(make_pair(a,b))
#define INF (20000000000000000LL)
#define MOD 1000000007
#define Endl endl
#define PI 3.141592653589793238
inline LL max(LL a,LL b){return (a>b)?a:b;}
inline int min(int a,int b){return (a<b)?a:b;}
LL gcd(LL a,LL b){return (b)?gcd(b,a%b):a;}
inline LL ab(LL a){return (a>0)?a:-a;}
LL lcm(LL a,LL b){return (a*b)/gcd(a,b);}
LL modpow(LL n,LL k,LL mod)
{LL ans=1;while(k>0){if(k&1)ans=(ans*n)%mod;k>>=1;n=(n*n)%mod;}return ans;}
LL poww(LL n ,LL k)
{LL ans=1;while(k>0){if(k&1)ans=(ans*n);k>>=1;n=(n*n);}return ans;}
//double min(double a,double b){return (a<b)?a:b;}
//double max(double a,double b){return (a>b)?a:b;}
//double ab(double x){return (x>=0.0)?x:-x;}
int myrandom(int i){return rand()%i;}

LL M[1000005]={};
vector<LL>P;
LL sieve()
{
	LL i,j;
	M[0]=M[1]=0;
	for(i=2;i*i<=1000000;i++)
	{
		
		if(M[i]==0)
		{
			P.pb(i);
			M[i]=1;
			for(j=i*i;j<=1000000;j+=i)
			{
				M[j]=i;
			}
		}
	}
	for(;i<=1000000;i++)
		if(M[i]==0)
		{
			P.pb(i);
			M[i]=1;
		}
	return 0;
}


int main()
{
	ios::sync_with_stdio(false);
	sieve();
	LL n,i,x,j,ans;
	cin>>n;
	ans=0;
	for(i=0;i<n;i++)
	{
		cin>>x;
		for(j=0;j<P.size() && P[j]<=x;j++)
		{
			while(x%P[j]==0)
			{
				ans+=x;
				x/=P[j];
			}
		}
		ans+=x;
        if(x>1)ans++;
	}
	cout<<ans<<endl;
	return 0;
}