#include <cstdlib>
#include <cctype>
#include <cstring>
#include <cstdio>
#include <cmath>
#include <algorithm>
#include <vector>
#include <string>
#include <iostream>
#include <sstream>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <fstream>
#include <numeric>
#include <iomanip>
#include <bitset>
#include <list>
#include <stdexcept>
#include <functional>
#include <utility>
#include <ctime>
using namespace std;
typedef long long LL;
typedef unsigned long long ULL;
#define MEM(a,b) memset((a),(b),sizeof(a))
const LL INF = 1e9 + 7;
const int N = 2e2 + 10;
map<LL, LL> mc;
vector<LL> v;
void check(LL x)
{
	v.clear();
	for (LL i = 1; i * i <= x; i++)
	{
		if (x%i) continue;
		v.push_back(i);
		if (i*i != x) v.push_back(x / i);
	}
	sort(v.begin(), v.end());
}
LL getans(LL x)
{
	if (x == 1) return 1;
	if (mc.count(x)) return mc[x];
	LL &ret = mc[x] = x + 1;
	int maxd = 0;
	for (auto &d : v)
	{
		if (x%d) continue;
		if (d >= x) break;
		ret = max(ret, x / d*getans(d) + 1);
	}
	return ret;
}
int main()
{
	//freopen("input.txt", "r", stdin);
	//freopen("output.txt", "w", stdout);
	int n;
	LL ans = 0;
	scanf("%d", &n);
	while (n--)
	{
		LL x;
		cin >> x;
		check(x);
		ans += getans(x);
	}
	cout << ans << endl;
	return 0;
}