#include<bits/stdc++.h>
using namespace std ;
#define pb push_back
#define mp make_pair
#define infile() freopen("large.in","r",stdin);
#define output() freopen("output.txt","w",stdout);
#define ll long long
#define sc(t); scanf("%d",&t);
#define scl(t); scanf("%lld",&t);
#define sc2(n,m); scanf("%d%d",&n,&m);
#define scl2(n,m); scanf("%lld%lld",&n,&m);
#define debug(); printf("tushar\n");
#define N 100005
#define mod 1000000007
#define printi(n) printf("%d",n);
#define inf ((1<<29)-1)
#define linf ((1LL<<60)-1)
const double eps = 1e-9;
set < ll > s ;
set < ll > :: iterator it ;
vector < ll > v ;
int n,m,q ;
int a[N] ;
ll func(ll tmp)
{
	ll ans = 0LL ; 
	while(1)
	{
		ll  i;
		ans = ans + tmp ; 
		int fg = 0  ;
		//printf("tmp = %lld ans = %lld\n",tmp,ans);
		for(i=2;i*i<=tmp;i++)
		{
			if(tmp%i == 0)
			{
				fg=1;
				tmp = tmp/i ;
				break ; 
			}
		}
		//printf("tmp = %lld ans = %lld\n",tmp,ans);
		if(fg==0)
		{
			ans = ans + 1LL ; 
			break;
		}
	}
	return ans;
}
int main()
{
int i , j , t ;
sc(n) ; 
ll ans = 0LL ;
for(i=1;i<=n;i++)
{
	ll tmp;
	scanf("%lld",&tmp) ; 
	if(tmp == 1)
	ans = ans  + 1LL ; 
	else
	ans = ans + func(tmp) ;
}
printf("%lld\n",ans);
return 0 ;
}