#include <bits/stdc++.h>

using namespace std;
typedef long long ll;

ll get(ll x)
{
    vector<ll> p;
    for (ll i = 2; i*i <= x; i++)
        while (x % i == 0)
        {
            x /= i;
            p.push_back(i);
        }
    if (x > 1)
        p.push_back(x);
    ll ans = 1;
    sort(p.begin(), p.end());
    for (int i = 0; i < p.size(); i++)
        ans = 1 + p[i]*ans;
    return ans;
}

long longestSequence(vector <long> a) {
    long ret = 0;
    for (int i = 0; i < a.size(); i++)
        ret += get(a[i]);
    return ret;
}

int main() {
    int n;
    cin >> n;
    vector<long> a(n);
    for(int a_i = 0; a_i < n; a_i++){
       cin >> a[a_i];
    }
    long result = longestSequence(a);
    cout << result << endl;
    return 0;
}