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

const int MAX = 1000000;

bool isPrime[MAX+1];
vector<int> primes;

int main()
{
    isPrime[0] = isPrime[1] = false;
    for (int i=2; i<=MAX; ++i) {
        isPrime[i] = true;
    }
    for (int i=2; i<=MAX; ++i) {
        if (isPrime[i]) {
            primes.push_back(i);
            for (int j=i+i; j<=MAX; j+=i) {
                isPrime[j] = false;
            }
        }
    }

    int n;
    cin >> n;

    long a;
    long long ans = 0;
    for (int i=0; i<n; ++i) {
        cin >> a;
        ans += a;
        for (int j=0; a>1 && j<primes.size(); ++j) {
            while (a % primes[j] == 0) {
                a /= primes[j];
                ans += a;
            }
        }
        if (a != 1) {
            ++ans;
        }
    }

    cout << ans;

    return 0;
}