#include <bits/stdc++.h>

using namespace std;

int longOneStickDiv(int n){
    if( n == 1){
        return 1;
    }else{
        int i=n/2;
        while( i>1 && n%i != 0){
            i--;
        }
        return n+longOneStickDiv(i);
    }
}

long longestSequence(vector <long> a, int n) {
    //  Return the length of the longest possible sequence of moves.
    long sum = 0;
    for(int i=0; i<n; i++){
        sum += longOneStickDiv(a[i]);
    }
    return sum;
}

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,n);
    cout << result << endl;
    return 0;
}