#include<stdio.h>
#include<string.h>
#include<stdlib.h>
#include<iostream>
#include<algorithm>
using namespace std;

typedef long long LL;

const int Maxn=105;
const int Maxl=1E6+5;

int N;
LL Ans;

int p[Maxl];
bool b[Maxl];
void PrePare(){
	int N=1E6;
	memset(b,true,sizeof(b));
	for(int i=2;i<=N;++i){
		if(b[i]) p[++p[0]]=i;
		for(int j=1;p[j]*i<=N;++j){
			b[p[j]*i]=false;
			if(i%p[j]==0) break ;
		}
	}
}

int main(){
	PrePare();
	scanf("%d",&N);
	for(int i=1;i<=N;++i){
		LL n; scanf("%lld",&n);
		for(int i=1;i<=p[0] && (LL)p[i]*p[i]<=n;++i)
			while(n%p[i]==0) Ans+=n,n/=p[i];
		if(n>1) Ans+=n; ++Ans;
	}
	printf("%lld",Ans);
	return 0;
}