#include <bits/stdc++.h>

using namespace std;
class Compare
{
	public:
bool operator()(pair<int, int> lhs, pair<int, int> rhs)
{
	return lhs.second < rhs.second;
}
};
pair<int , int> getPrime(long n)
{
	priority_queue<pair<int, int>, vector<pair<int, int>>, Compare> p;
	int count =0;
	while((n%2)==0)
	{
		count++;
		n /= 2;
	}
	if(count)
		p.push(make_pair(2, count));
	count =0;
	for (int i=3; i<= sqrt(n); i+=2)
	{
		while((n%i)==0)
		{count++;n /= i;}
		if(count)
			p.push(make_pair(i, count));
		count =0;
	}
	if(n>2)
		p.push(make_pair(n, 1));
	return p.top();
}
long longestSequence(vector <long> a) {
    //  Return the length of the longest possible sequence of moves.
	long total =0;
	int standard [] = {0, 1, 3, 4, 7, 6, 10, 8, 13,13, 16}; 
	for (int i=0; i<a.size();i++)
	{
		if(a[i] <=10)
		{
			total += standard[a[i]];
			continue;
		}
		//Get prime factor which has highest degree
		pair<int, int> res = getPrime(a[i]);
		//cout <<res.first<<"   "<< res.second<<endl;
		int prev;
		int left = a[i];
		for(int j =1; j<= res.second; j++, left=left/res.first)
			if(j==1)
				prev = res.first+1;
			else
				prev = ((2*prev) +1);
		
		
		prev *= left; 
		total += (prev +1);
	}
    
    return total;
}

int main() {
    int n;
    cin >> n;
    vector<long> a(n);
    for(int a_i = 0; a_i < n; a_i++){
       cin >> a[a_i];
    }
    long result = longestSequence(a);
    cout << result << endl;
    return 0;
}