#include <bits/stdc++.h>
using namespace std;

vector<int> primes;
void sieve() {
    int n = 1000007;
    vector<int> isprime(n, 1);
    isprime[0] = isprime[1] = 0;
    for(int i=2; i<n; i++) {
        if(!isprime[i]) continue;
        for(int j=i*2; j<n; j+=i) {
            isprime[j] = 0;
        }
    }
    for(int i=0; i<n; i++) {
        if(isprime[i])
            primes.push_back(i);
    }
}

long long moves(long long n) {
    long long ans = n, layer = 0, cnt = 0, orig = n;
    stack<long long> factors;
    for(int i=0; i<primes.size(); i++) {
        while(n%primes[i]==0) {
            factors.push(primes[i]);
            n/=primes[i];
        }
    }
    if(n>1) factors.push(n);
    cnt = layer = 1;
    while(factors.size()) {
        ans += cnt;
        layer = factors.top(); factors.pop();
        cnt = cnt * layer;
    }
    return ans;
}

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