#include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
using namespace std;


long long int find_first_factor(long long int x){
    long long int b = (long long int)sqrt(x); 
    //cout << b << " "<<x << "\n";
    for(int i=2; i<= b; i++){
        if(x%i == 0) return i;
    }
    return x;
}


long long int find_depth(long long int x){
    if(x == 1) return 0;
    long long int a = find_first_factor(x);
    //cout << a << "\n";
    return (x/a)+(find_depth(x/a));
}



int main() {  
    int n;
    cin >> n;
  
    long long int x ;
    long long int ans=0;
    //vector <long long> a(n);
    for (int i = 0; i < n; i++) {
        cin>>x;
        ans+=(x+find_depth(x));
    }
  
    cout<<ans<<"\n";
    /* Enter your code here. Print output to STDOUT */   
 
    return 0;
}