#include <bits/stdc++.h>
#define N 1000010
#define ll long long

using namespace std;

int n;
int arr[N];
vector<ll> primes;
ll val;

int sieve()
{
	for(int i=2;i<N;i++)
	{
		if(arr[i]==0)
		{
			primes.push_back(i);
			for(int j=2*i;j<N;j=j+i)
				arr[j]=1;
		}
	}
	return 0;
}

int main()
{
	sieve();
	ll res=0;
	scanf("%d",&n);
	while(n--)
	{
		scanf("%lld",&val);
		vector<pair<ll,ll> > fact;
		for(int i=0;i<(int)primes.size();i++)
		{
			int c=0;
			while(val%primes[i]==0)
			{
				val/=primes[i];
				c++;
			}
			if(c!=0)
				fact.push_back(make_pair(primes[i],c));
		}
		if(val!=1)
			fact.push_back(make_pair(val,1));
		ll sum=1;
		ll pro=1;
		for(int i=fact.size()-1;i>=0;i--)
		{
			for(int j=0;j<fact[i].second;j++)
			{
				pro*=fact[i].first;
				sum+=pro;
			}	
		}	
		res+=sum;
	}
	printf("%lld\n", res);
	return 0;
}