// Program to print all prime factors
#include "bits/stdc++.h"
 
using namespace std;

// A function to print all prime factors of a given number n
long long int primeFactors(long long int n)
{
	vector <long long int> v;
	while (n%2 == 0)
	{
	    v.push_back(2);
		//printf("%d ", 2);
		n = n/2;
	}

	// n must be odd at this point. So we can skip 
	// one element (Note i = i +2)
	for (long long int i = 3; i <= sqrt(n); i = i+2)
	{
		// While i divides n, print i and divide n
		while (n%i == 0)
		{
		    v.push_back(i);
			//printf("%d ", i);
			n = n/i;
		}
	}

	// This condition is to handle the case when n 
	// is a prime number greater than 2
	if (n > 2)
	    v.push_back(n);
		//printf ("%d ", n);
    long long int f=1,sum=1;
	for(long long int i=v.size()-1;i>=0;i--)
    {
        f=f*v[i];
        sum+=f;
    }
    return sum;
}

/* Driver program to test above function */
int main()
{
	int n;
    cin>>n;
    long long int sum=0;
    for(int i=0;i<n;i++)
    {
        long long int v;
        cin>>v;
        if(v==1)
        {
            sum+=1;
        }
        else
        {
            sum+=primeFactors(v);
        }
    }
    cout<<sum<<endl;
	return 0;
}