#include <bits/stdc++.h>

using namespace std;

long  getDivisor( long  a) {
    int val =1;
    for ( long  i =2; i*i <= a+1; i++) {
        if (a%i ==0) {
            val =i;
            return val;
        }
    }
    return a ;
}

long  getWays( long  num) {
    if (num==1)
        return 1;
    long  ways = num ;
    long  smallestdivisor = getDivisor(num);
    while(smallestdivisor > 1) {
        ways = ways + num/smallestdivisor;
        num = num/smallestdivisor;
        smallestdivisor = getDivisor(num);
    }
    return ways;
}

long longestSequence(vector <long> arr) {
    int len = arr.size();
    long  totalways = 0;
    for ( long i =0; i < len ; i++) {
        long  ways = getWays(arr[i]);
        totalways += ways;
    }
    return totalways;    
}

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