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

#define ULL unsigned long long 

vector<int> maxVal(11);

/* This function calculates (ab)%c */
int modulo(int a, int b, int c) {
	ULL x = 1, y = a; // long long is taken to avoid overflow of intermediate results
	while (b > 0) {
		if (b % 2 == 1) {
			x = (x*y) % c;
		}
		y = (y*y) % c; // squaring the base
		b /= 2;
	}
	return x%c;
}

bool Fermat(ULL p, int iterations) {
	if (p == 1) { // 1 isn't prime
		return false;
	}
	for (int i = 0; i<iterations; i++) {
		// choose a random integer between 1 and p-1 ( inclusive )
		long long a = rand() % (p - 1) + 1;
		// modulo is the function we developed above for modular exponentiation.
		if (modulo(a, p - 1, p) != 1) {
			return false; /* p is definitely composite */
		}
	}
	return true; /* p is probably prime */
}


ULL maxDiv(ULL n)
{
	if (n <= 0)
		return 0;
	//check if it is not prime
	if (n < maxVal.size() - 1)
		return maxVal[n];

	bool isPrime = true;
	int p = 1;
	if (n % 2 == 0)
		p = 2;
	else {
		if (Fermat(n, 20))
		{
			for (int i = 3; i < 1001; i += 2)
			{
				if (n%i == 0)
					isPrime = false;
			}
			if(isPrime)
				return n + 1;
		}
		

	for (int i = 3; i <= sqrt(n)+1; i+=2)
		if (n%i == 0)
		{
			p = i;
			break;
		}
	}
	if (p == 1)
		return n + 1;

	return maxDiv(n / p) + n;

}


int main()
{
	maxVal[1] = 1;
	maxVal[2] = 3;
	maxVal[3] = 4;
	maxVal[4] = 7;
	maxVal[5] = 6;
	maxVal[6] = 10;
	maxVal[7] = 8;
	maxVal[8] = 15;
	maxVal[9] = 13;
	maxVal[10] = 16;


	int n;
	cin >> n;

	
	ULL ans = 0, tmp = 0;;
	for (int i = 0; i < n; i++) {
		cin >> tmp;
		ans += maxDiv(tmp);
	}


	cout <<ans;

	


	return 0;

}