#define _CRT_SECURE_NO_WARNINGS
#include <cstdio>
#include <stdlib.h>
#include <string.h>
#include <memory.h>
#include <math.h>
#include <algorithm>
#include <vector>
#include <map>
#include <set>
#include <string>
#include <queue>
#include <ctime>

// Site: www.hackerrank.com 
// Competition: World Code Sprint 12
// Problem: Breaking Sticks
// Problem Code: Problem 3
// by lboris

/*
*/

typedef unsigned int uint;
typedef unsigned long long llu;
typedef long long int lls;

#define f(i,s,e) for(int i=s;i<(int)(e);++i)
#define fe(i,s,e) for(int i=s;i<=(int)(e);++i)
#define fi(i,s,e,d) for(unsigned int i=s;i<e;i+=d)
#define fie(i,s,e,d) for(unsigned int i=s;i<=e;i+=d)

char *iPrimes = 0;
int * lPrimes = 0;
int lPrimesNum = 0;

void get_primes(int n, int pn) {
	int lim = (int)sqrt((double)n) + 1;
	iPrimes = new char[n + 1];
	memset(iPrimes, 1, n + 1);
	iPrimes[0] = iPrimes[1] = 0;
	llu k;
	fe(i, 2, lim) {
		if (iPrimes[i] != 0) {
			if ((k = ((llu)i)*i)>n) break;
			fie(j, (int)k, (uint)n, i) {
				iPrimes[j] = 0;
			}
		}
	}
	lPrimes = new int[pn];
	fe(i, 2, n) {
		if (iPrimes[i] > 0) {
			lPrimes[lPrimesNum] = i;
			llu x = (llu)i*i;
			if (x < n) {
				for (int k = (int)x; k <= n; k += (int)x) {
					iPrimes[k] -= 1;
				}
			}
			lPrimesNum++;
		}
	}
}
int get_divs(llu n, llu * divs, int * pows)
{
	int nn = 0;
	int i = 0;
	while (i<lPrimesNum && (llu)lPrimes[i] * (llu)lPrimes[i] <= n) {
		pows[nn] = 0;
		int x = 1;
		while (n%lPrimes[i] == 0) {
			pows[nn] += 1;
			divs[nn] = lPrimes[i];
			x *= lPrimes[i];
			n = n / lPrimes[i];
		}
		if (pows[nn] != 0) {
			++nn;
		}
		++i;
	}
	if (n != 1) {
		divs[nn] = n;
		pows[nn++] = 1;
	}
	return nn;
}

int main(int argc, char **argv) {
	get_primes(1000000, 80000);
	int N;
	scanf("%d", &N);
	llu R = 0;
	f(i, 0, N) {
		llu n;
		scanf("%llu", &n);
		if (n == 1) R += 1;
		else {
			llu divs[30];
			int pows[30];
			int nd = get_divs(n, divs, pows);
			llu r = n;
			llu x = n;
			f(d, 0, nd) {
				f(p, 0, pows[d]) {
					x /= divs[d];
					r += x;
				}
			}
			R += r;
		}
	}
	printf("%llu", R);
	return 0;
}