#include <bits/stdc++.h>

using namespace std;

vector<int> prime;
map<int, long long int> m;

void sieve() {
    vector<int> x;
        
    x.resize(1000005, 1);
    
    for (int i=2; i*i<x.size(); i++) {
        if (!x[i])
            continue;
        
        for (int j=i*2; j<x.size(); j+=i) {
            x[j] = 0;
        }
    }
    
    for (int i=2; i<x.size(); i++) {
        if (x[i])
            prime.push_back(i);
    }
}

long long int rec(long long int curLen) {
    if (curLen == 1) {
        return 1;
    }
    
    if (m.find(curLen) != m.end())
        return m[curLen];
        
    for (int i=0; i<prime.size(); i++) {
        if (prime[i] >= curLen)
            break;
        
        if (curLen % prime[i] == 0) {
            m[curLen] = (long long int)(curLen / prime[i]) + rec(curLen / prime[i]);
            
            return m[curLen];
        }
    }
    
    m[curLen] = 1;
    return 1;
}

long longestSequence(vector <long> a) {
    //  Return the length of the longest possible sequence of moves.
    long long int total = 0;
    
    for (int i=0; i<a.size(); i++) {
        total += a[i];
        if (a[i] > 1)
           total += rec(a[i]);
    }
    
    return total;
}

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