#include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
#include <unordered_map>
using namespace std;

int longestSequence (unordered_map<int, int>& m, int n) {
    if (!m.count(n)) {
        int res = 0;
        for (int i = 2; i <= n; i++) {
            if (n % i == 0) {
                int k = n / i;
                res = max(res, 1 + i * longestSequence(m, k));
            }
        }
        m[n] = res;
    }
    
    return m[n];    
}



int main() {  
    int n;
    cin >> n;
  
    vector <long long> a(n);
    for (int i = 0; i < n; i++) {
        cin >> a[i];
    }
    
    sort(a.begin(), a.end(), greater<int>());
    
    /* Enter your code here. Print output to STDOUT */   
    
    unordered_map<int, int> m;
    m[1] = 1;
    int res = 0;
    for (int c : a) {
        res += longestSequence (m, c);
    }
    
    cout << res << endl;
    
    return 0;
}