#include <iostream>

using namespace std;

long longestSequence(long);
int main()
{
    int n;
    long x, ans = 0;
    cin >> n;
    
    while (n--)
    {
        cin >> x;
        ans += longestSequence(x);
    }

    cout << ans << endl;

    return 0;
}

long longestSequence(long x)
{
    long tmp = x, res = x, j = 2;

    while (j <= x)
    {
        while (tmp % j == 0)
        {
            tmp /= j;
            res += tmp;
        }

        j++;
    }

    return res;
}