#include <bits/stdc++.h>
using namespace std;
#define ll long long int 

ll dp[1000001];

bool m[1000001];

void pre()
{
	for(ll i=0;i<1000001;i++)
	{
		m[i]=true;
	}
	m[0]=false;
	m[1]=false;
	m[2]=true;
	for(ll i=2;i*i<1000001;i++)
	{
		if(m[i]==true)
		{
			for(int j=i;i*j<1000001;j++)
			m[i*j]=false;
		}
	}
}

bool check(ll n)
{
	if(n<1000001)
	{
		return m[n];
	}
	for(int i=3;i<=sqrt(n);i+=2)
	{
		if(n%i==0)
		return false;
	}
	return true;
}


ll f(ll n)
{
	if(n<=1000000&&dp[n]!=-1)
	return dp[n];
	ll ans=1+n;
	if(n%2==0&&(n&(n-1))==0)
	{
		ans=max(ans,1+2*f(n/2));
		dp[n]=ans;
		return ans;
	}
	if(n<1000001&&m[n]==true)
	{
		dp[n]=ans;
		return ans;
	}
	ll val=0,k=n;
	for(ll i=2;i*i<=k;i++)
	{
		if(check(i)==true)
		{
    			while(n%i==0&&n!=i)
	       		{
			     n/=i;
                 val=i;
			     }
		}
		//cout<<i<<" "<<n<<endl;
	}
	//cout<<n<<" "<<k<<endl;
	ans=max(ans,1+n*f(k/n));
	if(k<=1000000)
	dp[k]=ans;
	return ans;
}

int main() 
{
	pre();
	ll t;
	cin>>t;
	for(ll i=0;i<1000001;i++)
	{
		dp[i]=-1;
	}
	dp[1]=1;
	dp[2]=3;
	ll ans=0;
	while(t--)
	{
		ll n;
		cin>>n;
		ans+=f(n);
	}
	cout<<ans<<endl;
	return 0;
}