#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;

#define ll long long int

vector<ll> prime;
void preprocess()
{
	int i,j,k,n = 1000000;
	vector<bool> isprime(n+1,true);
	for(i = 4;i<=n;i+=2)
	{
		isprime[i] = false;
	}
	for(i = 3;i*i<=n;i+=2)
	{
		if(isprime[i])
		{
			for(j = i*i;j<=n;j+=2*i)
			{
				isprime[j] = false;
			}
		}
	}
	for(i = 2;i<=n;i++)
	{
		if(isprime[i])
		{
			prime.push_back(i);
		}
	}
}

int main()
{
	ll n,i,j,k,sum = 0,ln,num,val,sz,prod;
	preprocess();
	cin>>n;
	ln = prime.size();
	for(i = 0;i<n;i++)
	{
		cin>>num;
		j = 0;
		vector<pair<ll,ll> > pfact;
		while(j<ln&&num>1)
		{
			val = 0;
			while(num%prime[j] == 0)
			{
				val++;
				num = num/prime[j];
			}
			if(val)
			{
				pfact.push_back(make_pair(prime[j],val));
			}
			j++;
		}
		if(num>1)
		{
			pfact.push_back(make_pair(num,1));
		}
		sum += 1;
		sz = pfact.size();
		prod = 1;
		for(j = sz-1;j>=0;j--)
		{
			for(k = pfact[j].second;k>0;k--)
			{
				prod = prod*pfact[j].first;
				sum += prod;
			}
		}
	}
	cout<<sum;
}