#include <bits/stdc++.h>

using namespace std;

long longestSequence(vector <long> a) {
    //  Return the length of the longest possible sequence of moves.
    long count = 0;
    for(int i = 0; i < a.size();i++){
        long j = 2;
        while(a[i] >1){
            if(a[i] % j == 0){
                count += a[i];
                a[i]/= j;
            }
            else{
                j++;
            }
         }
        count++;
    }
    return count;
}

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