#include"bits/stdc++.h"
#define F(i,j,n) for(register int i=j;i<=n;i++)
#define D(i,j,n) for(register int i=j;i>=n;i--)
#define ll long long
#define N 210
using namespace std;
namespace io{
	const int L=(1<<19)+1;
	char ibuf[L],*iS,*iT,c;int f;
	char gc(){
		if(iS==iT){
			iT=(iS=ibuf)+fread(ibuf,1,L,stdin);
			return iS==iT?EOF:*iS++;
		}
		return*iS++;
	}
	template<class I>void gi(I&x){
		for(f=1,c=gc();c<'0'||c>'9';c=gc())if(c=='-')f=-1;
		for(x=0;c<='9'&&c>='0';c=gc())x=x*10+(c&15);x*=f;
	}
};
using io::gi;
using io::gc;
ll x,a,n,s[N],m,i;
int main()
{
	gi(n);
	while(n--){
		gi(a);
		m=1;
		for(i=2;i*i<=a;i++)if(a%i==0){
			while(a%i==0)a/=i,s[++m]=i;
		}
		if(a!=1)s[++m]=a;
		a=1;x++;
		D(i,m,1)a*=s[i],x+=a;
	}
	printf("%lld\n",x);
	return 0;
}