#include<bits/stdc++.h>
#define MAX 1000005
bool prime[MAX];
int size ; 
long long int primeNumber[MAX];
void sieve()
{
   	int n=MAX;
  	memset(prime, true, sizeof(prime));
 
    for (int p=2; p*p<=n; p++)
    {
      
        if (prime[p] == true)
        {
       
            for (int i=p*2; i<=n; i += p)
                prime[i] = false;
        }
    }
 
    int j=-1;
    for (int p=2; p<=n; p++)
       if (prime[p])
	primeNumber[++j]=p;
	size=j;
}
int main()
{
	sieve();
	long long int N,arr[MAX],ans,sum,i,j,temp;
	scanf("%lld",&N);
	for(i=0;i<N;i++)
		scanf("%lld",&arr[i]);
	ans=0;
	for(i=0;i<N;i++)
	{
		ans+=arr[i];
		sum=1;
		j=0;
		while(sum < arr[i] && j < size)
		{
			temp=sum*primeNumber[j];
			if(arr[i] % temp == 0)
			{
				sum*=primeNumber[j];
				ans+=arr[i]/sum;
			}
			else
			{
				j++;
			}
		}
		if(j == size && sum < arr[i])
			ans+=1;
	}
	printf("%lld\n",ans);
}