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

long long cal(long long a)
{
	vector <long long> nums;
	while (a%2 == 0)
    {
		nums.push_back(2);
		a = a/2;
    }
    int s=sqrt(a);
	for (int i = 3; i <= s; i = i+2)
	{
		while (a%i == 0)
		{
			nums.push_back(i);
			a = a/i;
		}
	}
	if(a>2)	nums.push_back(a);
	sort(nums.begin(), nums.end());

	for(int i=nums.size()-2;i>=0;i--)	nums[i]=nums[i+1]*nums[i];

	long long ans=1;
	for(int i=0; i<nums.size(); i++)	ans+=nums[i];
	return ans;
}

int main()
{
	long long ans=0,a;
	int n;
	scanf("%d",&n);
	for(int i=0; i<n; i++)
	{
		scanf("%lld",&a);
		if(a==1)	ans+=1;
		else	ans+=cal(a);
	}
	printf("%lld\n", ans);
	
	return 0;
}