#include <bits/stdc++.h>

using namespace std;

const int N = 1000000 + 10;

bool is_prime[N];
set<int> primes;
map<long long, int> factors;

map<long long, long long> mem;

void init(){
    for(int i=2; i<N; ++i) is_prime[i] = 1;
    for(long long n=2; n<N; ++n){
        if(!is_prime[n]) continue;
        for(long long d=n*n; d<N; d+=n) is_prime[d] = 0;
    }
    for(int i=2; i<N; ++i) if(is_prime[i]) primes.insert(i);
    
    mem[1] = 1;
}

void get_factors(long long x){
    factors.clear();
    for(auto p: primes){
        while(x%p == 0){
            x /= p;
            ++factors[p]; 
        }
        
        if(x < p*p) break;
    }
    
    if(x != 1) ++factors[x];
}

long long get_mem(long long x){
    if(mem.count(x)) return mem[x];
    
    long long res = 0;
    for(auto& pair: factors){
        if(pair.second){ 
            --pair.second;
            res = max(res, 1 + pair.first*get_mem(x/pair.first));
            ++pair.second;
        }  
    }    
    mem[x] = res;
    return res;
}

long long solve(long long x){
    get_factors(x);
    
    for(auto pair: factors){
        mem[pair.first] = 1 + pair.first;    
    }
    
    return get_mem(x);
}

int main() {  
    int n;
    long long res = 0;
    
    cin >> n;
  
    init();
    
    long long x;
    for (int i = 0; i < n; i++) {
        cin >> x;
        res += solve(x);
    }
  
    cout << res << endl;  
 
    return 0;
}