#include <bits/stdc++.h>

using namespace std;


long longestSequence(vector <long> a, int n) {
    //  Return the length of the longest possible sequence of moves.
    int prod,sum=0,count,summation=0,factor=0;
    for(int k=0;k<n;k++){
        sum=0;
        if(a[k]>1)
            factor=1;
        for(int i=2;i<sqrt(a[k]);i++){
            count=0;
            while(a[k]%i==0){
                a[k]/=i;
                count++;
                sum = i*(sum+1);
            }
        }
        sum = a[k]*(sum+1);
        summation+=sum+factor;
    }
    return summation;
}

int main() {
    int n;
    cin >> n;
    vector<long> a(n);
    for(int a_i = 0; a_i < n; a_i++){
       cin >> a[a_i];
    }
    long result = longestSequence(a,n);
    cout << result << endl;
    return 0;
}