#include<bits/stdc++.h>
using namespace std;
#define mod 1000000007
#define MAX 1000000000000000
#define all(v) v.begin(),v.end()
#define rep(i,a,b) for(i=(ll)a;i<(ll)b;i++)
#define revrep(i,a,b) for(i=(ll)a;i>=(ll)b;i--)
#define ii pair<ll,pair<ll,pair<ll,ll> > >
#define MP make_pair
#define pb push_back
#define f first
#define se second
#define ll long long int
#define vi vector<ll>
ll modexp(ll a,ll b){ ll res = 1; while(b > 0){  if(b & 1) res = (res * a);  a = (a * a);  b/=2;  }  return res; }
#define rs resize
long long readLI(){  register char c;  for(c = getchar(); !(c>='0' && c<='9'); c = getchar());  register long long a=c-'0';
    for(c = getchar(); c>='0' && c<='9'; c = getchar())
        a = (a<<3)+(a<<1)+c-'0';
    return a;
}
const ll N = 1000001;
ll n,i,a,ans;
bool prime(ll n)
{
    if(n < 2) return false;
    if(n < 4) return true;
    if(n%2 == 0) return false;
    if(n < 9) return true;
    if(n%3 == 0) return false;
    ll f = 5,r = sqrt(n);
    while(f <= r){
        if(n%f == 0) return false;
        if(n%(f + 2) == 0) return false;
        f += 6;
    }
    return true;
}
ll s(ll n)
{
    ll k,tmp,sum = 1,c = 1;
    vi e;
    for(i = 1;i <= sqrt(n);i++) if(n%i == 0){
        e.pb(i);
        if(n/i != i) e.pb(n/i);
    }
    sort(all(e));
    k = e.size();
    revrep(i,k - 1,0) if(prime(e[i])){
        tmp = n;
        while(tmp%e[i] == 0){
            c *= e[i];
            sum = sum + c;
            tmp /= e[i];
        }
    }
    return sum;
}
int main()
{
    std::ios_base::sync_with_stdio(false); cin.tie(NULL);
    cin>>n;
    while(n--){
        cin>>a;
        ans += s(a);
    }
    cout<<ans;
    return 0;
}