#include <bits/stdc++.h>
using namespace std;
#define ll long long
ll siz=1000010;
vector<bool>isPrime(siz+10,true);
void init(){
	int p=2;
	while(true){
		for(int i=2*p;i<=siz;i+=p){
			isPrime[i]=false;
		}
		bool found=false;
		for(int i=p+1;i<=siz;i++){
			if(isPrime[i]){
				p=i;
				found=true;
			}
		}
		if(!found){
			break;
		}
	}
}
ll find_total(ll num){
	if(num==1){
		return 1;
	}
	ll a=sqrt(num);
	ll gp=-1;
	for(ll i=2;i<=a+1;i++){
		if((num%i)==0){
			gp=i;
			break;
		}
		
	}
	//cout<<gp<<endl;
	if(gp==-1){
		return 1+num;
	}
	else{
		//cout<<find_total(num/gp)<<endl;
		return num+find_total(num/gp);
	}
}
int main()
{
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	init();
	int n;
	cin>>n;
	vector<ll>arr(n);
	for(int i=0;i<n;i++){
		cin>>arr[i];
	}
	ll total=0;
	for(int i=0;i<n;i++){
		total+=find_total(arr[i]);
	}
	cout<<total<<endl;
}