#include <bits/stdc++.h>

using namespace std;

long max(vector<long> a) {
	long max = a[0];
	for(long i=0;i<a.size();i++){
		if(max < a[i])
			max = a[i];
	}
	return max;
}

long fun(long n,vector<long>& arr){
	if(n==1)
		return 1;
	long max = INT_MIN;
	int c = 0;
	for(long i=2;i<=n;i++){
		if(n%i == 0){
			long x = n/i;
			if(arr[x] !=-1)
				c = 1+i*arr[x];
			else
				c = 1+i*fun(n/i,arr);
			if(max < c)
				max = c;
		}
	}
	return (arr[n] = max); 
}

long longestSequence(vector <long> a) {
	long m = max(a);
	vector<long> arr(m+1,-1);
	long ans = 0;
	for(int i=0;i<a.size();i++){
		ans +=fun(a[i], arr);
	}
    return ans;
}

int main() {
    int n;
    cin >> n;
    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;
}