#include <iostream>
#include <fstream>
#include <cstdio>
#include <cmath>
#include <vector>
#include <cstring>
#include <string>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <deque>
#include <algorithm>
#include <array>
using namespace std;

#define REP(i,n) for(int i=0; i<n; ++i)
#define FOR(i,a,b) for(int i=a; i<=b; ++i)
#define FORR(i,a,b) for (int i=a; i>=b; --i)
#define ALL(c) (c).begin(), (c).end()

typedef long long ll;
typedef vector<int> VI;
typedef vector<ll> VL;
typedef vector<VI> VVI;
typedef vector<VL> VVL;
typedef pair<int,int> P;
typedef pair<ll,ll> PL;
typedef vector<double> VD;

ll calc(ll x){
    ll ret = x;
    VL p;
    FOR(i,2,1e6){
        while (x % i == 0){
            x /= i;
            p.push_back(i);
        }
    }
    if (x > 1) p.push_back(x);
    reverse(ALL(p));
    ll s = 1;
    for (ll a : p){
        ret += s;
        s *= a;
    }
    return ret;
}

int main() {
    int n;
    cin >> n;
    ll ans = 0;
    while (n--){
        ll x;
        cin >> x;
        ans += calc(x);
    }
    cout << ans << endl;

    return 0;
}