#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <unordered_map>

using namespace std;
typedef long long LL;

LL ans, fc[100];
LL get(LL num){
	
	LL i, j, k = num; fc[0] = 0;
	for(i = 2; i * i <= num; i ++){
		while(num % i == 0){
			fc[++ fc[0]] = i;
			num /= i;
		}
	}
	if(num > 1)fc[++ fc[0]] = num;
	sort(fc + 1, fc + fc[0] + 1);
	for(i = fc[0], j = 1; i >= 1; i --){
		k += j;
		j *= fc[i];
	}
	return k;
}

int main(){

	int i, k; LL j;
	scanf("%d", &k);
	for(i = 1; i <= k; i ++){
		scanf("%lld", &j);
		ans += get(j);
	}
	printf("%lld", ans);

	return 0;
}