#include<bits/stdc++.h>
using namespace std;
#define ll long long
ll primeFactors(ll n)
{   ll temp=n;
    ll a[100]={0};
    int p=0;
	while (n%2 == 0)
	{
		a[p++]=2;
		n = n/2;
	}
	for (ll i = 3; i <= sqrt(n); i = i+2)
	{
		while (n%i == 0)
		{
			a[p++]=i;
			n = n/i;
		}
	}
	if (n > 2)
		a[p++]=n;
	
	ll ans=temp;
	for(int i=0;i<p;i++)
	{
	    ans+=(temp/a[i]);
	    temp=temp/a[i];
	}
	return ans;
}
int main()
{
	int n;
	cin>>n;
	ll arr[n];
	ll ans_f=0;
	for (int i=0;i<n;i++)
	{
	    cin>>arr[i];
	    ll k=primeFactors(arr[i]);
	    ans_f=ans_f+k;
	} 
	cout<<ans_f<<"\n";
	return 0;
}