#include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
using namespace std;
long long res = 0;
bool f[1000005] = {0};
void sieve()
{   long long i, j;
    for(i = 4; i <= 1000000; i += 2) f[i] = 1;
    for(i = 3; i <= 1000001; i++) if(f[i] == 0)
    {
            for(j = i * i; j <= (long long)(1000000); j += i) f[j] = 1;
    }
}
int main() {  
    int n;
    sieve();
    cin >> n;
    while(n--)
    {
        long long  x, i;
        long long s = 1;
        long long p = 0;
        cin >> x;
        long long k = 1;
        long long h = x;
        res += x;
        for(i = 2; i <= 1000000; i++)
        if(f[i] == 0){
                while(x % i == 0)
                {
                  x /= i;
                  res += x;
                }
        }
        if(x != 1) res++;
    }
    cout << res;
    return 0;
}