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

#define ll long long
const int N = 1e6+1 ;
bool p[N] ;

int main() {  
    int n;
    cin >> n;
  
    vector <ll> a(n) ;
    for (int i = 0; i < n; i++) {
        cin >> a[i] ;
    }
  
    /* Enter your code here. Print output to STDOUT */
    vector< ll > primes ;
    
    for( ll i = 2 ; i <= N ; i++ )
    {
        if( p[i] == 0 )
        {
            primes.push_back(i) ;
            
            for( ll j = i*i ; j <= N ; j+=i )
            {
                p[j] = 1 ;
            }
        }
    }
    
    ll sum(0) ;
    
    for( int i = 0 ; i < n ; i++ )
    {
        vector< ll > fs ;
        ll t = a[i] ;
        
        for( int i = 0 ; i < primes.size() && t > 1 ; i++ )
        {
            if( t%primes[i] == 0 )
            {
                fs.push_back( primes[i] ) ;
                t /= primes[i] ;
                i-- ;
            }
        }
        
        if( t > 1 )
        fs.push_back(t) ;
        
        ll p = 1 ;
        
        for( int i = int( fs.size() )-1 ; i >= 0 ; i-- )
        {
            p *= fs[i] ;
            sum += p ;
        }
        
        sum++ ;
    }
    
    cout << sum ;
    
    return 0;
}