#include<bits/stdc++.h>
 
#define X first
#define Y second
#define eb push_back
#define pb pop_back
#define mp make_pair
#define siz(a) int(a.size())
//for traversing the container (bcoz we cannot access linked list etc with direct index)
//c stands for container and it for iterator
#define tr(c, it) \
		for(typeof(c.begin()) it=c.begin() ; it != c.end() ; it++)
		
#define all(c) c.begin(), c.end()
#define present(container, element) (container.find(element) != container.end()) //whether the element is present in the container
 
#define trace2(x, y)             cout <<#x<<": "<<x<<" | "<<#y<<": "<<y<< endl;
#define trace3(x, y, z)          cout <<#x<<": "<<x<<" | "<<#y<<": "<<y<<" | "<<#z<<": "<<z<<endl;
#define trace4(a, b, c, d)       cout <<#a<<": "<<a<<" | "<<#b<<": "<<b<<" | "<<#c<<": "<<c<<" | "<<#d<<": "<<d<<endl;
#define trace5(a, b, c, d, e)    cout <<#a<<": "<<a<<" | "<<#b<<": "<<b<<" | "<<#c<<": "<<c<<" | "<<#d<<": "<<d<<" | "<<#e<<": "<<e<<endl;
#define scan(x) scanf("%lld", &x)
#define print(x) printf("%lld", x)
#define pN printf("\n");
//#define mod (((ll)1000000000) * ((ll)1000000000))
using namespace std;
 
typedef  long long     int ll;
typedef unsigned long long int ull;
typedef vector < int > vi;
typedef vector < vi > vvi;
typedef vector < ll > vll;
typedef vector < vll > vvll;
typedef pair < int , int > ii;
const ll mod=1e9+7;
const ll mod2=1e9+9;
const ll maxn = 1e6+5;
const ll maxn1 = 1e7+1;
const int root=1e6+5;
const long long inf = 1e18 + 18;
double pie4=3.1415926535;
//dont do silly mistake as always-
//1-read question properly(dont miss single line)
//2-check maximum array size	 
//3-int or long long int or ull or sort(a+1,a+n+1)-indexing
//4-do u understand question correctly(shampoo)?
//5-MOST IMP-BE CALM YOU CAN DO:)
//6-think edge case or corner case before submitting.
ll visit[maxn],a[101] ;
vector<ll>prime,f ;

void sieve(){
	
	ll i,j ;
	
	for(i=2;i<root;i++){
		
		if(visit[i])
		continue ;
		
		prime.eb(i) ;
		
		for(j=i*2;j<root;j+=i){
			
			visit[j] = 1 ;
		}
	}
}

void factorise(ll n){
	
	ll i ;
	
	for(i=0;i<siz(prime) && prime[i]*prime[i]<=n;i++){
		
		//trace2(prime[i],n);
		
		while(n%prime[i]==0){
			
			n = n/prime[i] ;
			
			f.eb(prime[i]);
		}
		
		if(n==1)
		break;
	}
	
	if(n>1)
	f.eb(n);
}

ll solve(){
	
	ll i,res=1,ans=0,a1=0 ;
	
	for(i=0;i<siz(f);i++){
		
		a1 = res * f[i] ;
		ans = ans+a1 ;
		res = a1 ;
		
		
		//trace3(f[i],res,ans);
	}
	
	
	return ans ;
}
		

int main(){
	
	
	ios_base::sync_with_stdio(false);cin.tie(NULL); cout.tie(NULL);
	
	ll i,n,sum = 0 ;
	
	sieve();
	
	cin >> n ;
	
	for(i=1;i<=n;i++){
		
		cin >> a[i] ;
		
		factorise(a[i]);
		
		sort(f.rbegin(),f.rend());
		
		sum = sum + solve() + 1 ;
		
		f.clear();
	}
	
	cout<<sum<<endl;
}