#include<bits/stdc++.h>
using namespace std;
#define MAX 1000000
vector<int>primes;
long long  a[105];
int sieve[10000005]={0};
void shieve()
{
	for(int i=2;i*i<=MAX;i++)
	{
		if(sieve[i]==0)
		{
			long long temp = i*i;
			while(temp<=MAX)
			{
				sieve[temp]=1;
				temp+=i;
			}
		}
	}
	for(int i=2;i<=MAX;i++)
	{
		if(sieve[i]==0)
		{
			primes.push_back(i);
		}
	}
}
int main()
{
	int n;
	scanf("%d",&n);
	long long ans=0;
	shieve();
	for(int i=0;i<n;i++)
	{
		scanf("%lld",&a[i]);
		long long num=a[i];
		if(num==1)
		{
			ans++;
			continue;
		}
		int first=0;
		long long curr_ans=0;
		for(int j=0;primes[j]*primes[j]<=num && j<primes.size();j++)
		{
			if(num%primes[j]==0)
			{
				if(!first)
				{
					first=1;
					curr_ans+=num;
				}
				while(num%primes[j]==0)
				{
					curr_ans+=num/primes[j];
					num=num/primes[j];
				}
			}
		}
		if(num>1)
		{
			if(!first)
			{
				curr_ans=num+1;
			}
			else
			{
				curr_ans+=1;
			}
		}
		ans+=curr_ans;
	}
	printf("%lld\n",ans);
	return 0;
}