#include<bits/stdc++.h>

#define X first
#define Y second
#define eb push_back
#define siz(a) int(a.size())
#define endl "\n"

#define trace2(x, y)             cout <<#x<<": "<<x<<" | "<<#y<<": "<<y<< endl;
#define trace3(x, y, z)          cout <<#x<<": "<<x<<" | "<<#y<<": "<<y<<" | "<<#z<<": "<<z<<endl;
#define trace4(a, b, c, d)       cout <<#a<<": "<<a<<" | "<<#b<<": "<<b<<" | "<<#c<<": "<<c<<" | "<<#d<<": "<<d<<endl;
#define trace5(a, b, c, d, e)    cout <<#a<<": "<<a<<" | "<<#b<<": "<<b<<" | "<<#c<<": "<<c<<" | "<<#d<<": "<<d<<" | "<<#e<<": "<<e<<endl;

using namespace std;

typedef long long int ll;
typedef vector < int > vi;
typedef vector < ll > vll;

const int mod=1e9+7;
const int maxn=1e6+55;

/*	finding inverse upto n
 * for i in xrange(2, N):
    ifc[i] = -(mod / i) * ifc[mod % i] % mod
 * 
*/
ll power(ll base, ll exp){ll res = 1; while(exp){if(exp%2)res*=base;base*=base;res%=mod;base%=mod;exp/=2;}return res;}

vll prime;
bool visit[maxn];

int main(){
	ios_base::sync_with_stdio(false);cin.tie(NULL); cout.tie(NULL);
	//freopen("input.in", "r", stdin);freopen("output.out", "w", stdout);	

	for(ll i = 2; i<maxn; i++){
		if(!visit[i]){
			for(ll j = i; j<maxn; j+=i){
				visit[j] = 1;
			}
			prime.eb(i);
		}
	}
	
	
	ll n, x;
	cin >> n;
	ll ans = 0;
	while(n--){
		cin >> x;
		ll ret = 1;
		ll y = 1;
		vll v;
		for(ll i = 0; i<siz(prime); i++){
			while(x%prime[i] == 0){
				x/=prime[i];
				v.eb(prime[i]);
			}
		}
		
		if(x != 1){
			v.eb(x);
		}
		reverse(v.begin(), v.end());
		for(ll i = 0; i<siz(v); i++){
			y *= v[i];
			ret += y;
		}
	
		ans += ret;
	
	}
	
	cout << ans;
	return 0;
}