#include <bits/stdc++.h>

using namespace std;
long factor(long n,long curr){
    if(n==1){
        return 1;
    }
    if(n==curr){
        return 1;
    }
    long k;
    long b=n/curr;
    int found =0;
    for(long i=2;i<=sqrt(b)+1;i++){
        if(b%i==0){
           k=curr*i; 
            found =1;
            break;
        }
    }
    if(found==0){
        k=curr*b;
    }
    
    return n/curr + factor(n,k);
    /*int k;
    for(int i=int(sqrt(n))+1;i>=1;i--){
        if(n%i==0){
            k=i;
            break;
        }
    }
    int j=n/k;
    if(j==1||k==1){
        return n+1;
    }
    else if(k>j){
        return j+j*factor(k); 
    }
    else if(j>=k){
        return k+k*factor(j);
    }
    return 0;*/
}
long longestSequence(vector <long> a,int n) {
    long sum=0;
    //long f;
    for(int i=0;i<n;i++){
        sum=sum+factor(a[i],1);
        //cout<<f<<' ';
    }
    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;
}