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

#define ll long long
#define ull unsigned long long
#define ld long double

typedef pair<int, int>	pi;
typedef pair<ll, ll>	pll;
typedef vector<int>		vi;
typedef vector<ll>		vl;
typedef vector<pi>		vpi;
typedef vector<pll>		vpll;
typedef vector<vi>		vvi;
typedef vector<vl>		vvl;

#define fo(i,n) for(i=0;i<n;i++)
#define Fo(i,k,n) for(i=k;k<n?i<n:i>n;k<n?i+=1:i-=1)
#define sub(a,b) a-b
#define orr(a,b) a||b
#define si(x)	scanf("%d",&x)
#define sl(x)	scanf("%lld",&x)
#define ss(s)	scanf("%s",s)
#define pi(x)	printf("%d\n",x)
#define pl(x)	printf("%lld\n",x)
#define ps(s)	printf("%s\n",s)
#define slen(s) strlen(s)
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define all(x) x.begin(), x.end()
#define clr(x) memset(x, 0, sizeof(x))
#define sortall(x) sort(all(x))
#define tr(it, a) for(auto it = a.begin(); it != a.end(); it++)
#define boostIO ios_base::sync_with_stdio(false), cin.tie(0)
#define tc(t) ll t; cin >> t; while(t--)
#define PI 3.1415926535897932384626
#define beg int main()
#define ret return 0
#define bye exit(0)
#define nxl <<endl
#define show cout<<
#define INF 0x3f3f3f3f
#define MAX 200000
#define mod 1000000007

ll power2(ll a, ll b) { if(b == 0) return 1; if(b == 1) return a; ll x = power2(a, b / 2); x = x * x; if(b % 2) x = x * a; return x;}
ll gcd(ll a, ll b) {if(a < b) swap(a, b); while(b) {ll t = b; b = a % b; a = t;} return a;}
ll mul(ll a, ll b, ll m = mod) { return (ll)(a * b) % m;}
ll add(ll a, ll b, ll m = mod) { a += b; if(a >= m) a -= m; if(a < 0) a += m; return a;}
ll power(ll a, ll b, ll m = mod) { if(b == 0) return 1; if(b == 1) return (a % m); ll x = power(a, b / 2, m); x = mul(x, x, m); if(b % 2) x = mul(x, a, m); return x;}


// ll bin_ser(ll low,ll high,ll key){

//    while(low<=high){
//        ll mid = (low+high)/2;
//        if(v1[mid]<key){
//            low = mid+1;
//        }
//        else if(v1[mid]>key){
//            high = mid-1;
//        }
//        else{
//            return (mid+1);
//        }
//    }
//    return -1;
// }

bool yoyo(const ll p1 ,const ll p2){
    return p1 > p2;
}

beg{

    ll i,j,k,l,t,a,r,n,m,b,c;
    cin >> n;
    ll su = 0;
    fo(j,n){
        cin >> a;
        ll val = 0;
        b = a;
        vpll v1;
        ll isp=0;
        if(a==1){
            su++;
            continue;
        }
        for(i=2;i*i<=a;i++){
            if(a%i==0){
                isp=1;
                break;
            }
        }
        if(!isp){
            su += (a+1);
            continue;
        }
        isp = 0;
        for(i=2;i*i<=b;i++){
            if(b%i==0){
                isp = 1;
                ll curr = i;
                ll co=0;
                while(b%i==0){
                    b = b/i;
                    co++;
                }
                v1.pb({curr,co});
            }
        }
        if(b>2){
            v1.pb({b,1});
        }
        if(!isp){
            su += (a+1);
        }
        else{
            ll mul = 1;
            ll cur = a;
            ll hm = 0;
            hm += mul;
            ll rep = v1[v1.size()-1].S;
            ll div = v1[v1.size()-1].F;
            //yup = 0;
            while(v1.size() && rep>0){
                //cout<<mul<<" "<<div<<" "<<rep<<endl;

                mul *= div;
                hm += mul;
                rep--;
                cur = cur/div;
                if(rep==0){
                    v1.pop_back();
                    rep = v1[v1.size()-1].S;
                    div = v1[v1.size()-1].F;
                }
            }
            su += hm;
        }
    }

    cout<<su<<endl;

ret;
}