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

int main() {  
    int n;
    cin >> n;
    vector <long long> a(n);
    for (int i = 0; i < n; i++) {
        cin >> a[i];
    }
    long long finalmoves=0;
    for(int i=0;i<n;++i){
        long long number = a[i];
        vector<long long> temp;
        if(number%2==0){
            temp.push_back(2);
            while(number%2==0)
                number = number/2;
        }
        for(long long j=3;j<=number/j;j=j+2){
            if(number%j==0){
                temp.push_back(j);
                while(number%j==0)
                    number = number/j;
            }
        }
        if(number!=1)
            temp.push_back(number);
        long long moves = 1;
        long long tempmoves = 1;
        for(int j=temp.size()-1;j>=0;--j){
            long long divisor = temp[j];
            while(a[i]%divisor==0){
                tempmoves = tempmoves*divisor;
                moves = moves + tempmoves;
                a[i] = a[i]/divisor;
            }
        }
        finalmoves = finalmoves + moves;
    }
    cout<<finalmoves;
    return 0;
}