#include <bits/stdc++.h>

using namespace std;
typedef long long ll;

bool IsPrime (ll n) {
   if (n < 2)      return false;
   if (n < 4)      return true;
   if (n % 2 == 0) return false;

   for (ll i = 3; i <= ll(sqrt(n)) + 1; i += 2)
       if (n % i == 0)
               return false;
   return true;
}
int largest_prime_factor(ll x){

    ll lpf = 0;
    if(IsPrime(x))return x;
    for (ll n = x/2; n >= 2 ; n--)
        if (IsPrime(n) && x % n == 0){
            lpf = n;
            break;
        }
    return lpf;

}

int main () {

    ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
    ll t,sum1=0,p;
    cin>>t;
    while(t--){
        cin>>p;
        ll sum=1,z=1;
        if(p==1)sum=1;
        else{
            ll m=p;
            while(1){
                ll b=largest_prime_factor(m);
                if(b==m){
                    sum=sum+p;
                    goto label;
                }
                z=z*b;
                sum+=z;
                m=m/b;
            }
        }
        label:sum1+=sum;
    }
    cout<<sum1;
    return 0;
}