#include <bits/stdc++.h>
#define ll long long int
using namespace std;
ll find_div(ll n)
{
	ll i=2;
	while(i<=sqrt(n))
	{
		if(n%i==0)
			return i;
		else i++;
	}
    return n;
}

int main()
{
	ll n,i;
	cin >> n;
	ll a[n];
	for(i=0;i<n;i++)
		cin >> a[i];
	ll mv=0,div;
	
	for(i=0;i<n;i++)
	{
		mv+=a[i];
		while(a[i]>1)
		{
			div=find_div(a[i]);
			if(div==a[i])
			{
				mv+=1;
				break;
			}
			else
			{
				mv+=a[i]/div;
				a[i]/=div;
			}
		}
	}
	cout<<mv<<endl;
	return 0;
}