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

int arr[1000001] ;

ll rec( ll x ){
    
   
    if( x <= (long long int)1e6  && arr[x])  return arr[x]  ; 
    
    ll maxi  = -1 ; 
    for(ll i = 2 ; i*i <= x ; ++i  ){
        
        if( x%i == 0  ){
            
            maxi = max(maxi , 1 + i*rec(x/i))  ;
            maxi = max(maxi , 1 + (x/i)*rec(i) ) ;             
        }
        
    }
    
    maxi = max(maxi , 1 + x)  ; 
    
    if( x <= (long long int)1e6) arr[x] = maxi ; 
    return maxi  ; 
}

int main() { 

    int n ; 
    cin>>n ; 
    arr[1] =1 ; 
    ll x ; 
    ll total = 0 ; 
    while(n--){
        
        cin>>x ; 
        total += rec(x)  ;
        
    }
    cout<<total<<endl;
    return 0;
}