#include <bits/stdc++.h>

using namespace std;

long longestSequence(vector <long> a) {
    int i=0;
    long s=0;
    while(i!=a.size()){
        if(a[i]!=1)
        s=s+a[i];
        long j=2;
        while(j*j<=a[i]){
            if(a[i]%j==0){
                 a[i]=a[i]/j;
                s=s+a[i];
           
                continue;
            }
            else
                j++;
        }
        s=s+1;
        i++;
    }
    return s;
}

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