#include <bits/stdc++.h>

using namespace std;

long long i, j, l, l1, t, x, k, m, s, ans, d[1000005], p[1000005], c[1000005];

int main()
{
    for (int i = 2; i <= 1000005; i++)
    {
        j = i+i;
        while (j <= 1000005)
        {
            if (d[j] == 0) d[j] = i;
            j+=i;
        }
    }

    l = 0;
    for (int i = 2; i <= 1000005; i++)
    {
        if (d[i] == 0)
        {
            p[l] = i;
            l++;
        }
    }

/*    cout << l << endl;
    for (int i = 0; i < l; i++)
    {
        cout << p[i] << endl;
    }
    cout << endl << endl << endl;*/

    cin >> t;


    ans = 0;
    while (t--)
    {
        cin >> x;
        l1 = 0;
        m = x;
        s = 1;
        while (s == 1)
        {
            k = m;
//            cout << m << " ";
            i = 0;
            while (p[i]*p[i] <= m)
            {
                if (m%p[i] == 0)
                {
                    m = m / p[i];
                    break;
                }
                i++;
            }
//            cout << m << endl;

            if (m == k)
            {
                s = 0;
                c[l1] = m;
                l1++;
            }
            else
            {
                c[l1] = p[i];
                l1++;
            }
        }
//        cout << l1 << endl;
        sort(c, c + l1);
//        reverse(c, c + l1);
        if (x == 1) ans++;
        else
        {
            c[l1] = 1;
            k = 1;
            ans+=1;
            for (int i = l1-1; i >= 0; i--)
            {
//                cout << c[i] << " ";
                k = k * c[i];
                ans+=k;
            }
//            cout << endl;
        }
    }

    cout << ans;
    return 0;
}