#include <bits/stdc++.h>

using namespace std;
#define ll long long

bitset <1000005> ciur;
vector <int> pr;

void sieve(int n){
    for(int i = 4;i <= n;i += 2){
        ciur[i] = 1;
    }
    pr.emplace_back(2);
    int i;
    for(i = 3;i * i <= n;i += 2){
        if(ciur[i] == 0){
            pr.emplace_back(i);
            for(int j = i*i;j <= n;j += 2 * i){
                ciur[j] = 1;
            }
        }
    }
    for(;i <= n;i += 2){
        if(ciur[i] == 0){
            pr.emplace_back(i);
        }
    }
}

int main(){
    sieve(1000000);
    int T;
    cin >> T;
    ll total = 0;
    while(T--){
        ll n;
        cin >> n;
        vector < ll > all;
        ll ans = 1;
        for(auto &it : pr){
            if(1LL * it * it > n){
                break;
            }
            while(n%it == 0){
                all.emplace_back(it);
                n /= it;
            }
        }
        if(n != 1){
            all.emplace_back(n);
        }
        for(int i = 0;i < all.size();i++){
            ans = 1 + ans * all[i];
        }
        total += ans;
    }
    cout << total;
    return 0;
}