#include <bits/stdc++.h>
using namespace std;
#define endl '\n'
long long mulmod(long long a,long long b,long long c){
    long long x = 0,y=a%c;
    while(b > 0){
        if(b%2 == 1){
            x = (x+y)%c;
        }
        y = (y*2)%c;
        b /= 2;
    }
    return x%c;
}
long long int modulo_exp(long long int a,long long int b,long long int c)
{
    long long x=1,y=a; 
    while(b > 0){
        if(b%2 == 1){
            x = mulmod(x,y,c);
        }
        y = mulmod(y,y,c); 
        b /= 2;
    }
    return x%c;
}
bool Fermat(long long p,int iterations){
    if(p == 1){ // 1 isn't prime
        return false;
    }
    for(int i=0;i<iterations;i++){
        // choose a random integer between 1 and p-1 ( inclusive )
        long long a = rand()%(p-1)+1; 
        // modulo is the function we developed above for modular exponentiation.
        if(modulo_exp(a,p-1,p) != 1){ 
            return false; /* p is definitely composite */
        }
    }
    return true; /* p is probably prime */
}
long long val(long long num)
{
	long long i;
	for(long long i=2;i*i <=num;i++)
	{
		if(num%i==0 && Fermat(i,18)==true)
			return i;
	}

		return -1;
}
int main()
{
	ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    int n;
    cin>>n;
    long long res=0,num;
    for(int i=0;i<n;i++)
    {
    	cin>>num;
    	if(num==1)
    		res+=1;
    	else
    	{
    		if(Fermat(num,18))
    		res+=(num+1);
    	else
    	{
    		long long r=0;
    		while(1)
    		{
    			r=val(num);
    			if(r!=-1)
    			{
    				res+=num;
    				num = num/r;	
    			}
    			else
    			{
    				res+= (num+1);
    				break;
    			}
    		}
    	}	
    	}
    	
    }
    cout<<res<<endl;
	return 0;
}