#include <bits/stdc++.h>

using namespace std;
#define ll long long
#define vi vector<ll>
#define vvi vector<vi>
#define pb push_back

ll calc(int u, vector<ll> &cur){
	if(u<0)
		return 1;
	return 1+cur[u]*calc(u-1,cur);
}
ll longestSequence(vector <ll> a) {
	ll ans=0;
	for(int i=0; i<a.size(); ++i){
		vector<ll> cur;
		for(ll j=2; j*j<=a[i]; ++j){
			while(a[i]%j==0){
				cur.pb(j);
				a[i]/=j;
			}
		}
		if(a[i]>1)
			cur.pb(a[i]);
		ans+=calc(cur.size()-1,cur);
	}
	return ans;
}
	
int main() {
	//freopen("input.txt", "r", stdin);
    int n;
    cin >> n;
    vector<ll> a(n);
    for(int a_i = 0; a_i < n; a_i++){
       cin >> a[a_i];
    }
    ll result = longestSequence(a);
    cout << result << endl;
    return 0;
}