#include<bits/stdc++.h>
using namespace std;

bool isPrime(long long int n)
{
    if (n <= 1)  return false;
    if (n <= 3)  return true;
    if (n%2 == 0 || n%3 == 0) return false;
    for (long long int i=5; i*i<=n; i=i+6)
        if (n%i == 0 || n%(i+2) == 0)
           return false;
    return true;
}

int main()
{
	int n;
	cin>>n;
	long long int arr[n];
	for(int i=0;i<n;i++)
	cin>>arr[i];
	long long int ans=0;
	for(int i=0;i<n;i++)
	{
		long long int tmp=0;
		long long int tmp1=arr[i];
		if(arr[i]==1)
		tmp=tmp1;
		else
		{
			while((isPrime(arr[i]))==false)
		{
			if(arr[i]%2==0)
			{
				tmp=tmp+(arr[i]/2);
				arr[i]=arr[i]/2;
			}
			else
			{
				long long int first=0;
			    for (long long int j = 3; j*j <= arr[i]; j = j+2)
                {
                   if (arr[i]%j == 0)
                   {
                    first=j;
                    break;
				   }
                }
                tmp=tmp+(arr[i]/first);
                arr[i]=arr[i]/first;
			}
		}
		tmp+=tmp1+1;
		}
		ans+=tmp;
	}
	cout<<ans<<endl;
	return 0;
}