#include <bits/stdc++.h>

using namespace std;

typedef long long ll;

ll solve(ll a)
{
    vector<ll> p;
    ll aa = a;
    for (ll i = 2; i * i <= aa; i++)
        while (a % i == 0)
        {
            a /= i;
            p.push_back(i);
        }
    if (a != 1)
        p.push_back(a);
    ll ans = 1;
    for (int i = 0; i < p.size(); i++)
        ans = ans * p[i] + 1;
    return ans;
}

int main() 
{  
    int n;
    cin >> n;
    ll ans = 0;
    for (int i = 0; i < n; i++) 
    {
        ll a;
        cin >> a;
        ans += solve(a);
    }
    cout << ans;
    return 0;
}