#include <bits/stdc++.h>

using namespace std;

typedef long long ll;

const int lim = 1e6;
ll x, ans;
vector<int> v;

void run_primes()
{
    bool ok; int i, j;
    v.push_back(2);
    for(i=3; i<lim; i+=2)
    {
        ok = 1;
        for(j=1; ok && j<v.size() && v[j] * v[j] <= i; ++j)
            if(i % v[j] == 0) ok = 0;
        if(ok) v.push_back(i);
    }
}

ll solve(ll x)
{
    vector<ll> p; int i;
    for(i=0; i<v.size() && v[i] * v[i] <= x && x > 1; ++i)
        while(x % v[i] == 0)
        {
            x /= v[i];
            p.push_back(v[i]);
        }
    if(x > 1) p.push_back(x);

    ll ans = 1;
    for(auto it : p) ans = ans * it + 1;
    return ans;
}

int main()
{
    run_primes();
    int n;
    cin >> n;
    while(n--)
    {
        cin >> x;
        ans += solve(x);
    }
    cout << ans << '\n';
    return 0;
}