#include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
using namespace std;
long divisor(long n);
bool prime(long p);
int main() {  
    int n;
    cin >> n;
  
    vector <long long> a(n);
    for (int i = 0; i < n; i++) {
        cin >> a[i];
    }
  long sum = 0;
    long d;
    for(int i=0;i<n;i++){
        while(a[i] != 1){
            sum = sum + a[i];
            d = divisor(a[i]);
            a[i] = a[i]/d;
        }
        sum = sum +1;
    }
    cout<<sum;
    return 0;
}
long divisor(long n){
    int i;
  if(n%2 == 0)
      return 2;
   if(prime(n)){
       return n;
   }
   else{
        for(i=3;i<=sqrt(n);i+=2)
        {
            if(n%i == 0){
                break;
            }
        }
        return i;
    }
}
bool prime(long p){
   if (p <= 1)  return false;
    if (p <= 3)  return true;
 
    // This is checked so that we can skip 
    // middle five numbers in below loop
    if (p%2 == 0 || p%3 == 0) return false;
 
    for (int i=5; i*i<=p; i=i+6)
        if (p%i == 0 || p%(i+2) == 0)
           return false;
 
    return true;
}