#include <iostream>
#include <algorithm>
#include <vector>
#include <queue>
#include <map>
#include <unordered_map>
#include <set>
#include <climits>
#include <cmath>
using namespace std;

long long solve(long long a, vector<int> &primes){
    long long ans = a;
    map<long long, int> mp;
    for(int i=0; i<primes.size() && primes[i]*primes[i] <= a; i++){
        int j = primes[i];
        while(a%j == 0){
            mp[j]++;
            a /= j;
        }
    }
    if(a != 1) mp[a]++;

    long long fac = 1;
    for(auto itr=mp.rbegin(); itr != mp.rend(); itr++){
        long long num = itr->first;
        int cnt = itr->second;
        for(int i=0; i<cnt; i++){
            ans += fac;
            fac *= num;
        }
    }
    return ans;
}

vector<int> sieve(int n){
    vector<bool> is_prime(n+1, true);
    is_prime[0] == false;
    is_prime[1] == false;
    vector<int> primes;
    for(int i=2; i<=n; i++){
        if(is_prime[i]){
            primes.push_back(i);
            for(int j=2*i; j<=n; j+=i){
                is_prime[j] = false;
            }
        }
    }
    return primes;
}

int main(){
    int n;
    cin >> n;
    vector<long long> a(n);
    for(int i=0; i<n; i++) cin >> a[i];

    vector<int> primes = sieve(2000000);

    long long ans = 0;
    for(int i=0; i<n; i++){
        ans += solve(a[i], primes);
    }
    cout << ans << endl;

    return 0;
}