#include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
using namespace std;
typedef long long ll;

bool isP(ll n){
	if(n==2 || n==3)
	return true;
	else{
		for(ll i=2;i<sqrt(n);++i)
		if(n%i==0)
		return false;
		
		return true;
	}
}

ll fun(ll n){
	if(n==1)
	return 1;
	else if(n==2)
	return 2;
	else if(isP(n))
	return n+1;
	else{
	   ll maxans=n;
	 for(ll i=2;i<sqrt(n);++i){
	   ll maxans2=0;
	   if(n%i==0){
	    ll p=n/i;
	    maxans2+=1;
	    if(i*fun(p)>p*fun(i)){
	    maxans2 += (i*fun(p)+i-1);
	    }
	    else{
	    maxans2+=(p*fun(i)+p-1);	
	    }
	   //maxans2 += max(i*fun(p),p*fun(i));
	    if(maxans2>maxans)
	    maxans=maxans2;
	    }
	 }
	 return maxans;
	}
}
int main() {  
    int n;
    cin >> n;
  ll ans=0;
    ll a[n];
    for (int i = 0; i < n; i++) {
        cin >> a[i];
        ans+=fun(a[i]);
    }
    cout<<ans<<endl;
    /* Enter your code here. Print output to STDOUT */   
 
    return 0;
}