#include <iostream>
#include <vector>
#include <cmath>
#include <algorithm>

using namespace std;

unsigned long long a[1000000];
int prime[1000000], s[1000000];
vector<int> p;

int main()
{
	prime[0] = prime[1] = 1;
	for (int i = 2; i < 1000000; i++)
	{
		if (!prime[i])
		{
			for (int j = 2 * i; j < 1000000; j += i)
			{
				prime[j] = 1;
			}
			p.push_back(i);
		}
	}
	unsigned long long n, sum = 0;
	cin >> n;
	for (int i = 0; i < n; i++)
	{
		unsigned long long a1;
		cin >> a1;
		unsigned long long t = 1;
		vector<unsigned long long> pf;
		for (int j = 0; p[j] <= a1 && j < p.size(); j++)
		{
			while (a1 % p[j] == 0)
			{
				a1 /= p[j];
				pf.push_back(p[j]);
			}
		}
		if (a1 > 1) pf.push_back(a1);
		for (int j = 0; j < pf.size(); j++)
		{
			t *= pf[j];
			t++;
		}
		sum += t;
	}
	cout << sum;
}