#include <cmath>
#include <cstdlib>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>

using namespace std;

void SieveOfEratosthenes(vector<bool>&prime , int n)
{
    
    for (int p=2; p*p<=n; p++)
    {
        if (prime[p] == true)
        {
            for (int i=p*2; i<=n; i += p)
                prime[i] = false;
        }
    }
 
    
}


long long findLeastPrime(vector<bool> &prime,long long n){
	
	long long temp = sqrt(n)+1;
    for(int i=2;i<temp;i++){
        if(prime[i] && n%i==0){
            return i;
        }
    }
    return n;
}

int main() {  
    int n;
    cin >> n;
    
    vector <long long > a(n);
    for (int i = 0; i < n; i++) {
        cin >> a[i];
    }
  
    /* Enter your code here. Print output to STDOUT */  
	
    int nMaxForPrime = 1000010;
    vector<bool> prime(nMaxForPrime,true);
    SieveOfEratosthenes(prime,nMaxForPrime);
    
	long long count = 0;
	
	for(int i=0;i<n;i++){
		if(a[i] == 1){
			count += 1;
			continue;
		}
        if(a[i] == 2){
            count += 3;
            continue;
        }
        if(a[i] < nMaxForPrime && prime[a[i]]==true){
            count += a[i]+1;
            continue;
        }
		
        long long temp = a[i];
        long long lsp;
        count += temp;
		while(temp != 1){
			lsp = findLeastPrime(prime,temp);
            count = count + (temp/lsp);
            temp = temp/lsp;
		}
		
		
	} 
	cout<<count<<endl;
 
    return 0;
}