//============================================================================
// Name        : prime2.cpp
// Author      : 
// Version     :
// Copyright   : Your copyright notice
// Description : Hello World in C++, Ansi-style
//============================================================================

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

const int SIZE=1000000;
bool status[SIZE]={false};
vector<int> prino;
void prime()
{
	int i,j,l=sqrt(SIZE),count=0;


	for(i=3;i<=l;i+=2)
	{
		if(status[i>>1]==false)
		{
			for(j=i*i;j<=SIZE;j+=i+i)
			{
				status[j>>1]=true;
			}
		}
	}

	//cout<<2<<" ";
	prino.push_back(2);
	for(i=3;i<=SIZE;i+=2)
	{
		if(status[i>>1]==false)
		{
//			cout<<i<<" ";
			prino.push_back(i);
			count++;
		}
	}

//	cout<<"\n"<<count;
}
// Stores  prime factors of number in a array lst

long long primefacz(long long n)
{
	int lst[1000];
	int lsize;
	lsize=0;

	for(int i=0;i<sqrt(n);i++)
	{
		while(n%prino[i]==0)
		{
			n/=prino[i];
			lst[lsize]=prino[i];
			lsize++;
		}
	}

	if(n>1)
	{
		lst[lsize]=n;
		lsize++;
	}
//	cout<<"\n";
	long long mul=1,ans=0;
	ans+=mul;
	for(int i=lsize-1;i>=0 ;i--)
	{
		mul*=lst[i];
		ans+=mul;
	}

	return ans;
}
int main() {
	prime();
	int n,i;
	cin>>n;
	long long a[n],ans=0;
	for(i=0;i<n;i++)
	{
		cin>>a[i];
		ans+=primefacz(a[i]);
	}
	cout<<ans;
	return 0;
}