#include <bits/stdc++.h>
#define ll long long
#define fr first
#define sc second
#define NN ((ll)(4e5+100))
#define N ((ll)(1e6+100))
#define ARRS ((ll)(1e6+100))
#define EP ((1.0e-3))
#define M ((ll)(1e9+7))
#define MOD ((ll)(1e9+7))
#define MAX ((ll)(1e12+7))
#define pb push_back
#define inf ((ll)1e16)
#define mx 2003
#define PI 3.14159265358979323846
using namespace std;

ll f[ARRS+100];
ll c[ARRS+100];

int main(){
	f[1]=1;
	for(int i=2; i<N; i++){
		if(!f[i])
			for(int j=2*i; j<N; j+=i)
				f[j]=i;
	}
	ll n,k;
	cin>>n;
	ll pp=0;
	for(ll i=0; i<n; i++){
		cin>>k;
		ll c=1;
		ll pas=0;
		ll pe=1;
		vector<ll> v;

		for(ll j=1; j*j<=k; j++){


			ll p=j;
			if(f[p]==0){
				if(k%p==0)
					v.pb(p);
				while(k%(pe*p)==0)pe*=p;
			}

			//cout<<j<<" "<<k<<" "<<j*j<<endl;

			if(j*j==k)continue;


			p=k/j;
			if(p<=1000000 && f[p]==0)
				if(k%p==0)
					v.pb(p);
			
			

		}

		if(k/pe>1)
			v.pb(k/pe);

		sort(v.begin(),v.end());
		reverse(v.begin(),v.end());

		for(auto p:v){
			while(k%p==0){
				k/=p;
				pas+=c;
				c*=p;
			}
		}


		pp+=pas+c;
	}
	cout<<pp<<endl;
}