#include <bits/stdc++.h>

using namespace std;
typedef long long ll;

bool isPrime(ll a){
    if(a == 1)return 0;
    for(ll i=2;i<=sqrt(a);i++){
        if(a%i == 0) return 0;
    }
    return 1;
}

ll check(ll a){
    //cout<<a<<endl;
    if(a==1)return 1;
    if(isPrime(a)){return a+1;}
        ll ans =a;
        while(a != 1){
            if(isPrime(a)){ans += 1; break;}
            for(int i=2;i<=sqrt(a);++i){
                if(a%i == 0){
                    ans += (a/i);
                    a =a / i;
                    break;
                }
            }
            if(a==1)break;
        }
        return ans;
    return 0;
}


long longestSequence(vector <long> a) {
    long long ans = 0;
    for(long i:a){
        ans += check(i);
    }
    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;
    return 0;
}