#include <bits/stdc++.h>

using namespace std;

bool isPrime(long long int num) {
    int flag = 0;
    for(long long int i = 2; i <= sqrt(num); i++) {
        if(num % i == 0) {
            flag = 1;
            break;
        }
        else
            flag = 0;
    }
    if(flag == 1) {
        return false;
    }
    else
        return true;
}
long longestSequence(vector <long> a) {
    //  Return the length of the longest possible sequence of moves.
    long long int cost = 0;
    for(int i = 0; i < a.size(); i ++) {
        long long int temp = a[i];
        if(!isPrime(temp)){
            while(temp > 1) {
                if(temp%2 == 0) {
                //cout<<"*"<<endl;
                    temp/=2;
                    cost+=temp;
                    //cout<<a[i]<<"-"<<temp<<endl;
                }
                else if(temp%2 != 0) {
                    if(isPrime(temp)){
                    //cout<<"%"<<endl;
                        cost += 1;
                        //cout<<cost<<endl;
                        break;
                    }
                    else{
                        //cout<<"#"<<endl;
                        for(int j = 3; j < temp; j ++) {
                            if(temp%j==0){
                                cost+=temp/j;
                                temp = temp/j;
                                //cout<<cost<<endl;
                                break;
                            }
                        }
                    }
                }
                
            }
            cost+=a[i];
                //cout<<cost<<endl;
        }
        else if(isPrime(temp) && temp != 1)
            cost+=a[i]+1;
        else
            cost+=1;
        //cout<<"cost = " <<cost<<endl;    
    }
    return cost;
}

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;
}