#include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
#include <unordered_map>
using namespace std;
int countDivisors(long long n, unordered_map<long long, int>& m)
{
    if(n<=1) return 0;
    if(m.find(n) != m.end())
        return m[n];
    int maxcount = 0;
    for(int i=2; i<=n;i++){
        if(n % i == 0) {int c = 1 + i*countDivisors(n/i, m); if(c > maxcount) maxcount  = c; }
    }
    m[n] = maxcount;
    return maxcount;
}
int main() {  
    int n;
    cin >> n;
  
    vector <long long> a(n);
    for (int i = 0; i < n; i++) {
        cin >> a[i];
    }
    long long sum = 0;
    unordered_map<long long, int> m;
    for(int i=0; i<n;i++){
        sum += a[i] + countDivisors(a[i],m);
    }
    /* Enter your code here. Print output to STDOUT */   
    cout<<sum<<endl;
    return 0;
}