#include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
using namespace std;

// A function to print all prime factors of a given number n
long long primeFactors(long long n)
{   
    if (n == 1) {
        return 1;   
    }
    long long ret = n;
    for (long long i=2; i <= sqrt(n) && n > 1; ++i ){
        while (n % i == 0) {
            n /= i;
            if (n != 1) ret += n;
        }
    }
    return ret+1;
}

int main() {  
    int n;
    cin >> n;
  
    vector<long long> arr(n);
    long long sum = 0;
    for (int i = 0; i < n; i++) {
        cin >> arr[i];
        sum += primeFactors(arr[i]);
    }
    
    cout << sum << endl;
  
    /* Enter your code here. Print output to STDOUT */ 
    
 
    return 0;
}