#include<bits/stdc++.h>
#include<vector>
using namespace std;
void primeFactors(long long n,vector<long long> &vect)
{
    while (n%2 == 0)
    {
    	vect.push_back(2);
        n = n/2;
    }
 
    for (long long i = 3; i <= sqrt(n); i = i+2)
    {
        while (n%i == 0)
        {
            vect.push_back(i);
            n = n/i;
        }
    }
 
    if (n > 2)
        vect.push_back(n);
}

long long func(vector<long long> &vect)
{
	long long p = vect[0]+1;
	for(long long i=1;i<vect.size();i++)
	{
		p = (p*vect[i])+1;
	}
	return p;
}
int main()
{
	long long n;
	cin>>n;
	long long a[n];
	for(long long i=0;i<n;i++)
	{
		cin>>a[i];
	}
	long long count = 0;
	vector<long long> vect;
	for(long long i=0;i<n;i++)
	{
		if(a[i] == 1)
		{
			count++;
		}
		else
		{
			vect.resize(0);
			primeFactors(a[i],vect);
			count += func(vect);	
		}
	}
	cout<<count<<endl;
}