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

vector <long long> v;
long long ans;

void solve(long long a)
{
    long long temp = a; 
    long long n = a;
    while (n%2 == 0)
    {
        v.push_back(2);
        n = n/2;
    }
 
    for (int i = 3; i <= sqrt(n); i = i+2)
    {
        while (n%i == 0)
        {
            v.push_back(i);
            n = n/i;
        }
    }
 
    if (n > 2)
       v.push_back(n);
    
    sort(v.begin(), v.end());
    ans += temp;
    
    if(v.size() == 0 && temp != 1)
    {
        ans += 1;
    }
    for(int i = 0;i < v.size();i++)
    {
        ans += temp/v[i];
        temp = temp/v[i];
    }
    v.clear();
}
int main() {  
    int n;
    cin >> n;
    
    ans = 0;
    
    vector <long long> a(n);
    
    for (int i = 0; i < n; i++) {
        cin >> a[i];
        solve(a[i]);
    }
    
    cout<<ans<<endl;
    return 0;
}