#include <bits/stdc++.h>

using namespace std;
#define mx 1000002
vector<long long> prime;

bool isPrime(long long n)
{
    // Corner cases
    if (n <= 1)  return false;
    if (n <= 3)  return true;
    // This is checked so that we can skip 
    // middle five numbers in below loop
    if (n%2 == 0 || n%3 == 0) return false;
    for (long long i=5; i*i<=n; i=i+6)
        if (n%i == 0 || n%(i+2) == 0)
           return false;
    return true;
}

void calculatePrimeNumber(){
   prime.push_back(2);
   prime.push_back(3);
   for(int i=5;i<=mx;i+=2){
       if(isPrime(i)){
           prime.push_back(i);
       }
   } 
}

long long longestSequence(vector <long> a) {
    //  Return the length of the longest possible sequence of moves.
    long long ans = 0;
    int len = a.size();
    for(int i=0;i<len;i++){
        int j=0;
        ans+=a[i];
        long long temp = a[i];
        if(isPrime(temp)){
            ans++;
        }
        else{
          while(temp>1 && j<=temp/2+1){
            while(temp>=prime[j] && temp%prime[j]==0){
                ans+=temp/prime[j];
                temp =temp/prime[j];
                //cout<<temp<<" ";
            }
            j++;
          }
        }
        //cout<<ans<<" ";
    }
    return ans;
}

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