#define lop(i, n) for (ll i = n-1; i >= 0; i--)
#define loop(i, x) for (ll i = 0; i < x; i++)
#define loopf(i, x, n) for (ll i = x; i < n; i++)
#define loopr(i, x, n) for (ll i = x - 1; i >= n; i--)
#define ain(arr, n) for (ll i = 0; i < n; i++) cin>>arr[i]
#define aout(arr, n) for (ll i = 0; i < n; i++) cout<<arr[i]<<" "
#define mm(lamb, tttt) memset(lamb, tttt, sizeof lamb)

#define null NULL
#define eps 0.000000001
#define mod 1000000007
#define pb push_back
#define pf push_front
#define mp make_pair
#define fe first
#define se second
#define ALL(V) V.begin(), V.end()
#define sz(V) (ll)V.size()

#include <iostream>
#include <stdio.h>
#include <stack>
#include <queue>
#include <deque>
#include <vector>
#include <iterator>
#include <bitset>
#include <list>
#include <map>
#include <unordered_map>
#include <cstring>
#include <string>
#include <algorithm>
#include <cmath>
#include <cassert>
#include <limits.h>
#include <iomanip>
#include <cctype>
#include <numeric>
#include <complex>

using namespace std;

typedef long long ll;
typedef vector <ll> vi;
typedef vector<vi> vvi;
typedef pair <ll, ll> pi;
typedef pair<ll, pair<ll,ll> > pii;
typedef complex<ll> ci;

ll n;
ll data[110];
vi primes;

void sieve(ll lim)
{
	bitset<1001000> isp;
	isp.set();
//	cout<<isp<<"\n";
	loopf(i, 2, lim+1)
	{
		if (isp[i])
		{
			primes.pb(i);
//			cout<<"here"<<"\n";
			for(ll j = 1LL*i*i; j <= lim; j+= i)
				isp[j] = false;
		}
	}
	return ;
}

ll calc(ll val)
{
	ll res = val;
//	cout<<"hello"<<sz(primes)<<"\n";
	for(ll i = 0; i < sz(primes) && val != 1; i++)
	{
		while(val % primes[i] == 0)
		{
			val /= primes[i];
			res += val;
		}
	}
	if (val != 1) res ++;
	return res;
}

ll longSeq()
{
	ll res = 0;
	loop(i, n)
	{
		res += calc(data[i]);
//		cout<<res<<"\n";
	}
	return res;
}

int main()
{
	ios_base::sync_with_stdio(false);
	cin>>n;
	sieve(1000000);
	ain(data, n);
	cout<<longSeq()<<"\n";
	return 0;
}