#include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
#include <bits/stdc++.h>
#define ll unsigned long long
using namespace std;
ll prime[1000007];
vector<ll>v;
void init() {
    prime[0]=0,prime[1] = 1;
    for(int i=2;i<1000007;i++) {
        if(prime[i] == 0) {
            v.push_back(i);
            for(int j = i+i;j<1000007;j+=i) {
                prime[j] = 1;
            }
        }
    }
}
int main() {  
    ll n;
    cin >> n;
    ll a[n];
    ll ans = 0;
    init();
    for(int i=0;i<n;i++) {
        cin >> a[i];
        //cout << v[i] << endl;
    }
    for(int i=0;i<n;i++) {
        ll m = a[i];
        for(int j=0;j<v.size() && v[j] <= m;j++) {
            //cout << v[j] << " ";
            while(m % v[j] == 0) {
                ans += m;
                m = m/v[j];
            }
            if(m < pow(10,6) && prime[m] == 0) {
                //cout << m << endl;
                ans += m;
                m = 1;
                break;
           }
        }
        if(m == 1)
            ans += m;
        else
            ans += m+1;
    }
    cout << ans << endl;
    return 0;
}