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

long long find(long long x){
    long long sum = 1;
    if(x!=1) sum+=x;
    while(!(x%2)){
        sum+=x/2;
        x/=2;
    }
    for(int i=3; i<sqrt(x); i+=2){
        while(!(x%i)){
            sum+=x/i;
            x/=i;
        }
    }
    
    return (long long)sum;
}

int main() {  
    int n;
    cin >> n;
    long long moves = 0;
    
    vector <long long> a(n);
    for (int i = 0; i < n; i++) {
        cin >> a[i];
        moves+=find(a[i]);
    }
    
    cout<<moves;
  
    /* Enter your code here. Print output to STDOUT */   
 
    return 0;
}