#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;


long long int sum;
vector< long long int> dp;
void calculateWays()
{
	long long int devisor;
	vector<long long int> maxvec;
	for (long long int i = 4; i < 10001; i++)
	{
		devisor = i / 2;
		maxvec.clear();
		for (long long int j = devisor; j > 0 ; j--)
		{
			if (i%j == 0)
			{
				maxvec.push_back(dp[j]*(i/j));
			}
		}
		dp[i] = (*max_element(maxvec.begin(), maxvec.end()))+1;
	}
}
int main()
{
	dp.resize(10001);
	dp[1] = 1;
	dp[2] = 3;
	dp[3] = 4;
	calculateWays();
	int n,m;
	cin >> n;
	for (int i = 0; i < n; i++)
	{
		cin >> m;
		sum += dp[m];
	}
	cout << sum;
}