#include <bits/stdc++.h>
#include<stdint.h>
#include<unordered_map>
#define ll long
using namespace std;
unordered_map<ll,ll>prime;
//unordered_map<ll,ll>prime;
bool isPrime(ll number){
    ll no=number/2;
    for(ll i=3;i<no;i++){
        if(number%i==0){
            prime[number]=i;
            return false;
        }
    }
    return true;
}


long longestSequence(vector <long> a) {
    //  Return the length of the longest possible sequence of moves.
    ll moves=0;
    for(ll i=0;i<a.size();i++){
        ll cur=a[i];
        moves=moves+cur;
        if(cur>1){
       // cout<<"moves is: "<<moves<<endl;
        while(cur!=1){
            if(cur%2!=0){
                if(isPrime(cur)){
                   // cout<<cur<<" is prime"<<endl;
                cur=1;
                }
                else{
                    cur=cur/(prime[cur]);
                    moves=moves+cur;
                }
            }
            else{
            cur=cur/2;
                if(cur!=1){
                    moves=moves+cur;  
                }
            }
        }
            moves=moves+cur;
        }
    }
    return moves;
}

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