#include <bits/stdc++.h>

using namespace std;

long longestSequence(vector <long> a) {
    long ans=0;
    for(int i=0;i<a.size();i++){
        ans+=a[i];
        while(a[i]%2==0){
            a[i]/=2;
            ans+=a[i];
        }
        for(int j=3;j<=sqrt(a[i]);j+=2){
            while(a[i]%j==0){
                a[i]/=j;
                ans+=a[i];
            }
        }
        if(a[i]>1){
            ans+=1;
        }
    }
    return ans;
}

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