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

long long longestSequence(long long x)
{
    vector<pair<long long, int>> v;
    for (int i = 2; 1LL * i * i <= x; i++)
    {
        if (x % i == 0)
        {
            int e = 0;
            while (x % i == 0)
            {
                x /= i;
                e++;
            }
            v.push_back({(long long)i, e});
        }
    }
    if (x > 1)
    {
        v.push_back({x, 1});
    }
    sort(v.begin(), v.end());
    long long many = 1;
    long long ans = 1;
    for(int j=v.size()-1; j>=0; j--) {
        auto & it = v[j];
        for(int i=1; i<=it.second; i++) {
            many *= it.first;
            ans += many;
        }
    }
    return ans;
}

int n;

int main()
{
    cin >> n;
    long long s = 0;
    for (int i = 1; i <= n; i++)
    {
        long long x;
        cin >> x;
        s += longestSequence(x);
    }
    cout << s << '\n';
    return 0;
}