#include <iostream>
#include <bits/stdc++.h>
using namespace std;

#define debug(x) cout<<#x<<" :: "<<x<<"\n";
#define debug2(x,y) cout<<#x<<" :: "<<x<<"\t"<<#y<<" :: "<<y<<"\n";
#define debug3(x,y,z) cout<<#x<<" :: "<<x<<"\t"<<#y<<" :: "<<y<<"\t"<<#z<<" :: "<<z<<"\n";

#define boost ios::sync_with_stdio(0); cin.tie(0)

typedef long long ll;
typedef double ld;
typedef pair<int, int> pii;

const int N = 1e6 + 5;

/***************************************************************************/

int ss[N];
vector<long> primes;

long longestSequence(vector <long> a) {
    //  Return the length of the longest possible sequence of moves.

    for(int i=2; i*i<N; i++) {

        if(ss[i]) continue;

        for(int j=i*i; j<N; j+=i) {
            ss[j] = 1;
        }
    }

    for(int i=2; i<N; i++) {
        if(ss[i]) continue;
        primes.push_back(i);
    }

    long ans = 0;

    for(long it : a) {

        ans += it;

        for(long p : primes) {

            while(it % p == 0) {
                it /= p;
                ans += it;
            }

            if(it == 1) break;
        }

        if(it != 1) ans++;
    }

    return ans;
}

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);
    cout << result << endl;
    return 0;
}