#include <bits/stdc++.h>
using namespace std;

#define boost ios::sync_with_stdio(false);cin.tie(NULL)
#define ll long long
#define ull unsigned long long
#define pll pair<ll,ll>
#define pb push_back
#define mp make_pair
#define fs first
#define sc second
const ll MOD=1E9+7;
const ll N=1E6+7;

vector<ll> fact;

void prime_fact(ll n)
{
	fact.clear();

	while (n%2==0) {
		n>>=1;
		fact.pb(2);
	}

	ll i;
	for (i=3;i<=sqrt(n);i+=2) {
		while (n%i==0) {
			fact.pb(i);
			n/=i;
		}
	}

	if (n>2)
		fact.pb(n);

	sort(fact.begin(),fact.end());
}

ll solve(ll ind)
{
	if (ind<0)
		return 1;

	return 1+fact[ind]*solve(ind-1);
}

int main()
{
    boost;
    if(fopen("inp.txt", "r")) {
      freopen("inp.txt", "r", stdin);
      freopen("outp.txt", "w", stdout);
    }

    ll n;
    cin>>n;

    ll a[n],i;
    ll ans=0;

    for (i=0;i<n;i++) {
    	cin>>a[i];
    	prime_fact(a[i]);

    	// for (auto v: fact)
    	// 	cout<<v<<" ";
    	// cout<<endl;

    	if (a[i]==1)
    		ans++;
    	else
    		ans+=solve(fact.size()-1);
    }

    // for (i=1;i<=24;i++)
    // 	cout<<dp[i]<<" ";
    // cout<<endl;

    cout<<ans;
    
    return 0;
}