#include <bits/stdc++.h>

using namespace std;

#define endl "\n"
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;

const int INF = 2000000000;
const int MAX=100000;

const int lim=1000005;

ll p[lim];
vector<ll>primes;

void seive(){
	p[0]=p[1]=0ll;
	for(int i=2;i<lim;i++){
		if(p[i]){
			primes.push_back(i);
			for(int j=i*2;j<lim;j+=i){
				p[j]=0ll;
			}
		}
	}
}

int main(){
	ios_base::sync_with_stdio(0);
//	cin.tie(0);
	srand(time(NULL));
	memset(p,1,sizeof p);
	seive();
//	for(int i=0;i<primes.size();i++)
//		cout<<primes[i]<<endl;
//	cout<<primes.size()<<endl;
	int n;
	cin>>n;
	ull cnt=0;
	for(int i=0;i<n;i++){
		ll x;
		cin>>x;
		cnt++;
		vector<ll>v;
		for(int i=0;i<primes.size();i++){
			if(x==1)
				break;
			while(x%primes[i]==0){
				v.push_back(primes[i]);
				x/=primes[i];
			}
		}
		if(x>1)
			v.push_back(x);
		ll tmp=1;
		for(int i=v.size()-1;i>=0;i--){
			tmp*=v[i];
			cnt+=tmp;
		}
	}
	cout<<cnt<<endl;
	return 0;
}