#include <bits/stdc++.h>

using namespace std;

const int N = 105;
long long a[N];
vector<long long> v1;
map<long long, long long> mp;

void div(long long n) {
	vector<long long> v2;
	for(int i = 1; i <= sqrt(n); i ++) {
		if(n % i == 0) {
			if(n / i == i) {
				v1.push_back(i);
			}
			else {
				v1.push_back(i);
				v2.push_back(n / i);
			}
		}
	}
	for(int i = v2.size() - 1; i >= 0; i--) {
		v1.push_back(v2[i]);
	}
	long long p = 1, res = n;
	for(int i = 1; i < v1.size(); i ++) {
		if(v1[i] % p == 0) {
			res += (n / v1[i]);
			p = v1[i];
		}
	}
	mp[n] = res;
	v1.clear();
}

int main() {
	cin.sync_with_stdio(false);
	int n;
	cin >> n;
	long long res = 0;
	for(int i = 0; i < n; i ++) {
		cin >> a[i];
		if(mp[a[i]]) {
			res += mp[a[i]];
		}
		else {
			div(a[i]);
			res += mp[a[i]];
		}
	}
	cout << res << endl;
	return 0;
}