#include <iostream>
#include <queue>
#include <algorithm>

#define N 1000001
#define P 78498
#define LL long long int
using namespace std;

LL divs[N],ans[N],d;
bool isprime[N];
LL primes[P],p=0;

void prep() {
	int i,j;
	for (i=0;i<N;i++) isprime[i]=true;
	for (i=2;i<N;i++) {
		if (!isprime[i]) continue;
		for (j=i+i;j<N;j+=i) isprime[j]=false;
	}
	for (i=2;i<N;i++) if (isprime[i]) primes[p++]=i;
}

LL f(LL n) {
	if (n==1) return 0;
	int i;
	LL ff=1,nn=n,prime=-1;
	for (i=0;i<P&&primes[i]<n;i++) {
		if (n%primes[i]!=0) continue;
		prime=primes[i];
		break;
	}
	if (prime==-1) return 1;
	while(n%prime==0) {
		n/=prime;
		ff*=prime;
	}
	//cout << ff << ' ' << n << '\n';
	return ((ff-1)/(prime-1))*n+f(n);
}

int main() {
	prep();
	int t,i,j;
	LL n,res=0;
	cin >> t;
	while(t--) {
		cin >> n;
		res+=n+f(n);
		//cout << n+f(n) << '\n';
	}
	cout << res << '\n';
	
	return 0;
}