#include <bits/stdc++.h>

#define MAXN 111

using namespace std;

using lint = long long int;

int N;
lint nums[MAXN];

vector<lint> factz(const lint num){
    lint current = num;
    
    vector<lint> lo;
    for(int i=2 ; i<=sqrt(num) ; ++i){
        while(current%i == 0){
            lo.push_back(i);
            current /= i;
        }
    }
    if(current != 1)    lo.push_back(current);
    return lo;
}

lint coco(const lint num){
    vector<lint> divs = factz(num);
    lint res = 0, coeff = 1;
    for(int i=divs.size()-1 ; i>-1 ; --i){
        res += coeff;
        coeff *= divs[i];
    }
    res += coeff;
    return res;
}

void solve() {
    lint res = 0;
    for(int i=0 ; i<N ; ++i){
        res += coco(nums[i]);
    }
    cout << res << endl;
}

void test_factz(){
    while(1){
        int q;cin>>q;
        vector<lint> bolens = factz(q);
        for(int bolen : bolens) cout<<bolen<<" ";cout<<endl;
    }
}

void test_coco(){
    while(1){
        int q;cin>>q;
        cout << coco(q) << endl;
    }   
}

int main() {
    cin >> N;
    for(int a_i = 0; a_i < N; a_i++) cin >> nums[a_i];
    solve();
    // test_factz();
    // test_coco();
    return 0;
}