#include <bits/stdc++.h>

using namespace std;
long long sumStick(long long a)
{
    map<long long, int> div;
    while(a % 2 == 0)
    {
        div[2]++;
        a /= 2;
    }
    for(int i = 3; i <= sqrt(a); i += 2)
    {
        while(a % i == 0)
        {
            a /= i;
            div[i]++;
        }
    }
    if(a != 1)
        div[a]++;
    long long moves = 0;
    long long count = 1;
    for(map<long long, int>::reverse_iterator it = div.rbegin(); it != div.rend(); ++it)
    {
        while(it->second > 0)
        {
            moves += count;
            count *= it->first;
            --(it->second);
        }
    }
    moves += count;
    return moves;
}
long long longestSequence(vector <long long> a) {
    long long ans = 0;
    for(int i = 0; i < a.size(); ++i)
        ans += sumStick(a[i]);
    return ans;
}

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