// Nipun Poddar , CSE, MNNIT Allahabad
 
#include<iostream>
#include<cstdio>
#include<vector>
#include<map>
#include<queue>
#include<cmath>
#include<stack>
#include<cstring>
#include<algorithm>
 
#define in(n) scanf("%d",&n)
#define in2(n,m) scanf("%d%d",&n,&m)
#define in3(n,m,p) scanf("%d%d%d",&n,&m,&p)
#define inll(n) scanf("%lld",&n)
#define inll2(n,m) scanf("%lld%lld",&n,&m)
#define out(n) printf("%d\n",n)
#define out2(n,m) printf("%d %d\n",n,m)
#define outll(n) printf("%lld\n",n)
#define outll2(n,m) printf("%lld %lld\n",n,m)
#define inc(n) scanf("%c",&n)
#define minm(a,b) (a<b?a:b)
#define maxm(a,b) (a<b?b:a)
#define loop(n) for(i=0;i<n;i++)
#define loop1(n) for(i=1;i<=n;i++)
#define fill0(x) memset(x,0,sizeof(x))
#define fill1(x) memset(x,-1,sizeof(x))
#define PB push_back
#define MP make_pair
#define F first
#define S second
#define pii pair<int,int>
#define ppi pair<int,pii>
 
#define REP(i, n) for(int i = 0; i < (n); i++)
#define FOR(i, a, n) for(int i = a; i < n; i++)
#define REV(i, a, n) for(int i = a; i > n; i--)
#define FORALL(itr, c) for(itr = (c).begin(); itr != (c).end(); itr++)
#define ALL(A) A.begin(), A.end()
#define LLA(A) A.rbegin(), A.rend()
 
//int dx[] = {-1, 0, 1, 0}, dy[] = {0, 1, 0, -1};
//int dx[] = {1, 1, 1, 0, 0, -1, -1, -1}, dy[] = {1, 0, -1, 1, -1, 1, 0, -1};
 
#define chkbit(s, b) (s & (1<<b))
#define setbit(s, b) (s |= (1<<b))
#define clrbit(s, b) (s &= ~(1<<b))
 
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef unsigned int ui;
 
 
#define MOD 1000000007
#define MOD_INV 1000000006
#define MAX 100009
#define INF 999999999
 
inline int max2(int a, int b) {
	return ((a > b)? a : b);
}
 
inline int max3(int a, int b, int c) {
	return max2(a, max2(b, c));
}
 
long long gcd(long long a,long long b)
{
	while(b)
		b^=a^=b^=a%=b;
	return a;
}
long long int power(long long int b,long long int e)
{
	long long ans=1,temp;
	while(e>0)
	{
		if(e%2)
			ans=(ans*b)%MOD;
		b=(b*b)%MOD;
		e/=2;
	}
	return ans;
}
/*
inline int next_int() {
	int n = 0;
	char c = getchar_unlocked();
	while (!('0' <= c && c <= '9')) {
		c = getchar_unlocked();
	}
	while ('0' <= c && c <= '9') {
		n = n * 10 + c - '0';
		c = getchar_unlocked();
	}
	return n;
}*/
 
using namespace std;

ll a[105];
map<ll,ll> dp;

ll funFunc(ll x)
{
	//cout<<x<<endl;
	if(dp[x])
		return dp[x];
	vector<pair<ll,int> > factor;
	ll ans=x+1;
	ll x1=x;
	//cout<<"----------->   "<<x<<endl;
	for(ll i=2;(i*i)<=x1;i++)
	{
		if((x1%i)==0)
		{
			int cnt=0;
			while((x1%i)==0)
			{
				x1/=i;
				cnt++;
			}
			factor.PB(MP(i,cnt));
		}
	}
	if(x1>1)
		factor.PB(MP(x1,1));
	//cout<<x<<" "<<factor.size()<<endl;
	for(int j=0;j<factor.size();j++)
	{
		pair<ll,int> f=factor[j];
		ll i=f.F;
		int cnt=1;
		while(cnt<=f.S)
		{
			if(i==x) break;
			ll tmp=x/i;
			if(!dp[i])
				ans=maxm(ans,tmp*funFunc(i) + 1);
			else
				ans=maxm(ans,tmp*dp[i] + 1);
			tmp=i;
			if(!dp[x/i])
				ans=maxm(ans,tmp*funFunc(x/i) + 1);
			else
				ans=maxm(ans,tmp*dp[x/i] + 1);
			i*=f.F;
			cnt++;
		}
	}
	
	dp[x]=ans;
	//cout<<x<<" "<<dp[x]<<endl;
	return ans;
}

int main()
{
	int t,i,j,n,m;
	in(n);
	loop(n) inll(a[i]);
	dp[1]=1;
	
	ll ans=0;
	loop(n) ans+=funFunc(a[i]);
	outll(ans);
	return 0;
}