#include <bits/stdc++.h>

using namespace std;

long findLargestFactor(int n){
    ((uint64_t)n);
    long count;
    long largest;
    for(long factor = 1 ; factor <= n ; factor++){
        if(n % factor == 0){
            count = 0;
            for(long primetest = 2 ; count == 0 && factor > primetest ; primetest++){
                if(factor % primetest == 0)
                    count++;
            }
            if(count == 0)
                largest = factor;
        }
    }
    return largest;
}

long solveNumber(int n){
    if(n == 1)
        return 1;
    long largestFactor = findLargestFactor(n);
    //cout<<largestFactor<<endl;
    long result = 0;
    long divided = n / largestFactor;
    if(largestFactor == n){
        return 1 + n;
    }
    result += 1;
    result += largestFactor * solveNumber(divided);
    return result;
}

long longestSequence(vector <long> a) {
    //  Return the length of the longest possible sequence of moves.
    long result = 0;
    for(int i = 0 ; i < a.size() ; i++){
        long tmp = solveNumber(a[i]);
        result = result + tmp;
    }
    return result;
}

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;
}