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

int main() {  
    int n;
    cin >> n;
  
    vector <long long> a(n);
    long long int ans = 0;
    for (int i = 0; i < n; i++) {
        cin >> a[i];
        long long int mul = 1;
        vector<long long int> primes;
        while(a[i]%2==0) {
            primes.push_back(2);
            a[i]/=2;
        }
        for(long long int j = 3; j*j <= a[i]; j+=2) {
            while(a[i]%j==0) {
                a[i]/=j;
                primes.push_back(j);
            }
        }
        if(a[i]!=1) {
            primes.push_back(a[i]);
        }
        for(int j = primes.size()-1; j>=0; j--) {
            ans+=mul;
            mul*=primes[j];
            //cout<<mul<<endl;
        }
        //cout<<mul<<endl;
        ans+=mul;
        
    }
    cout<<ans<<endl;
    /* Enter your code here. Print output to STDOUT */   
 
    return 0;
}