#include <iostream>
#include <stdio.h>
#include <limits>
#include <cstdio>
#include <algorithm>
#include <vector>
#include <string>
#include <cmath>
#include <list>
#include<iterator>
#include<iomanip>
using namespace std;
#define li long
#define in(x) scanf("%d",&x)
#define lin(x) scanf("%ld",&x)
#define out(x) printf("%d\n",x)
#define lout(x) printf("%ld\n",x)
#define vi vector<int>
#define fl(i,n) for(i=0;i<n;i++)

int main()
{
	int i,n;
	int size = 1000000;
	bool seive[1000001];
	fl(i,size+1)
	{
		seive[i] = true;
		//out(i);
	}
	vi a;
	seive[0]=false;
	seive[1]=false;
	for(i=2;i*i<=size;i++)
	{
		if(seive[i]==true)
		{
			//a.push_back(i)
			for(int j=i*i;j<=size;j+=i)
			{
				seive[j]=false;
			}
		}
	}
	fl(i,size)
	{
		if(seive[i]==true)
		{
			a.push_back(i);
			//out(i);
		}
	}
	in(n);
	li ans = 0;
	fl(i,n)
	{
		li k;
		vi factors;
		lin(k);
		//lout(k);
		int j=0;
		while(a[j]*a[j]<=k&&j<a.size())
		{
			if(k%a[j]==0)
			{
				while(k%a[j]==0)
				{
					factors.push_back(a[j]);
					k/=a[j];
				}
			}
			j++;
		}
		//lout(k);
		if(k!=1) factors.push_back(k);
		li p=1;
		for(j=factors.size()-1;j>=0;j--)
		{
			ans+=p;
			p*=factors[j];
		}
		ans+=p;
	}
	lout(ans);
}