#include <bits/stdc++.h>

using namespace std;

long long int calc(long long int a, vector <long long int> primes) {
    long long int i, j = primes.size(), k, sum = a;
    for(i=0;i<j;i++){
        if(a%primes[i] == 0){
            while(a%primes[i] == 0){
                a = a/primes[i];
                sum += a;
            }
        }
    }
    if(a != 1){
        sum++;
    }
    return sum;
}


int main() {
    int a[1000002] = {0};
    vector <long long int> primes;
    int i, j;
    for(i=2;i<1000002;i++){
        if(a[i] == 0){
            j = i;
            primes.push_back(i);
            while(j<1000002){
                a[j] = 1;
                j = j+ i;                
            }
        }
    }
    
    int n;
    cin >> n;
    long long int sum = 0, temp;
    
    for(int a_i = 0; a_i < n; a_i++){
       cin >> temp;
       sum += calc(temp, primes);
    }
    cout << sum << endl;
    return 0;
}