#include <bits/stdc++.h>
using namespace std;
#define ll long long
vector<long long>primes;
long long readInt () {
	bool minus = false;
	long long result = 0;
	char ch;
	ch = getchar();
	while (true) {
		if (ch == '-') break;
		if (ch >= '0' && ch <= '9') break;
		ch = getchar();
	}
	if (ch == '-') minus = true; else result = ch-'0';
	while (true) {
		ch = getchar();
		if (ch < '0' || ch > '9') break;
		result = result*10 + (ch - '0');
	}
	if (minus)
		return -result;
	else
		return result;
}
void simpleSieve(long long limit, vector<long long> &prime){
    bool mark[limit+1];
    memset(mark, true, sizeof(mark)); 
    for (long long p=2; p*p<limit; p++){
        if (mark[p] == true){
            for (long long i=p*2; i<limit; i+=p)
                mark[i] = false;
        }
    }
    for (long long p=2; p<limit; p++){
        if (mark[p] == true){
            prime.push_back(p);
        }
    }
}
vector<long long> segmentedSieve(long long n){
    long long limit = floor(sqrt(n))+1;
    vector<long long> prime;  
    simpleSieve(limit, prime); 
    long long low  = limit;
    long long high = 2*limit;
    while (low < n){
        bool mark[limit+1];
        memset(mark, true, sizeof(mark));
        for (long long i = 0; i < prime.size(); i++){
            long long loLim = floor(low/prime[i]) * prime[i];
            if (loLim < low)
                loLim += prime[i];
            for (long long j=loLim; j<high; j+=prime[i])
                mark[j-low] = false;
        }
        for (long long i = low; i<high; i++)
            if (mark[i - low] == true)
                prime.push_back(i);
        low  = low + limit;
        high = high + limit;
        if (high >= n) high = n;
    }
    return prime;
}
bool isPrime(long long n){
	for(int i=0;i<primes.size();i++){
		if(n%primes[i]==0){
			return 0;
		}
	}
	return 1;
}
int main(){
	long long t;
	t=readInt();
    primes=segmentedSieve(1000001);
    long long ans=0;
	while(t--){
		long long n;
		n=readInt();
		ans+=n;
		for(long long i=0;i<primes.size();i++){
			if(n==1) break;
			else if(n%primes[i]==0){
				n/=primes[i];
				ans+=n;
				i--;
			}
		}
        if(n!=1){
            ans+=1;
        }
	}
	printf("%lld \n",ans);
	return 0;
}