#include<bits/stdc++.h>
using namespace std;
stack<long long int> st;
void primeFactors(long long int n)
{
    while (n%2 == 0)
    {
    	st.push(2);
        //printf("%d ", 2);
        n = n/2;
    }
    for (long long int i = 3; i <= sqrt(n); i = i+2)
    {
        while (n%i == 0)
        {
            //printf("%d ", i);
            st.push(i);
            n = n/i;
        }
    }
    if (n > 2)
    st.push(n);
}
int main()
{
	long long int i,j,k,n,m,sum=1,s=0;
	cin>>n;
	while(n--)
	{
		cin>>k;
		primeFactors(k);
		long long int t=1;
		sum=1;
		while(!st.empty())
		{
			sum=sum+t*st.top();
			t=t*st.top();
			st.pop();
		}
		s=s+sum;
	}
	cout<<s<<endl;
	return 0;
}