//ciphereck    //cppcom
#include<bits/stdc++.h>
#define ll long long
#define fs first
#define se second
#define pb push_back
#define re(x) scanf("%lld",&x)
using namespace std;

ll spf[1000010]; ll sieve(){ spf[0]=-1; spf[1]=-1; for(ll i=2;i<1000010;i+=2) spf[i]=2; for(ll i=3;i<1000010;i+=2){ if(spf[i]) continue; spf[i]=i;
    for(ll j=i*i;j<1000010;j+=i){ if(!spf[j]) spf[j]=i; } } return 0; }


ll power(ll x, ll y, ll p){ ll res = 1; x = x % p;
    while (y > 0){  if (y & 1)  res = (res*x) % p;  y = y>>1; x = (x*x) % p;  }   return res; }

ll modInverse(ll n, ll p) { return power(n, p-2, p); }  // only if P is prime

vector<ll> v;

ll rec(ll val, ll in){
  if(val==1) return 1;
  for(ll i=in;i>=0;i--){
    if(val%v[i]==0) return v[i]*rec(val/v[i], i)+1;
  }
  return val;
}


int main(){
  ios_base::sync_with_stdio(false);
  sieve();
  for(ll i=1;i<=1000000;i++) if(spf[i]==i) v.pb(i);
  ll n; cin>>n;
  ll ans=0;
  for(ll i=0;i<n;i++){
    ll x; cin>>x; ans+=rec(x, v.size()-1);
  }
  cout<<ans;
  return 0;
}