#include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
using namespace std;
long primeFactors(long n)
{
    long count=n;
    if(n!=1)
        count+=1;
    while (n%2 == 0)
    {
        n = n/2;
        count+=n;
        
    }
    for (long i = 3;i*i <= n; i = i+2)
    {
        while (n%i == 0)
        {
            n = n/i;
            count+=n;
         }
    }
    return count;
}

int main() {  
    int n;
    cin >> n;
    
    unsigned long long count=0;
    vector <long> a(n);
    for (int i = 0; i < n; i++) {
      cin >> a[i];
    count+=primeFactors(a[i]);    
    }
    cout<<count<<endl;
   return 0;
}