#include <bits/stdc++.h>

using namespace std;
long moves(int a){
    long ans=0;
    if(a==1)ans=1;
    else{int d,f=0;
        for(d=2;d<a;d++){
            if(a%d==0){f=1;break;}
        }
       if(f==1){ans+=1+(a/d)*moves(d);}
           //(a/d)*moves(a/d);
       else{ans+=(a+1);}  
    }
    return ans;
}
long longestSequence(vector <long> a) {
    //  Return the length of the longest possible sequence of moves.
    long sum=0,k=0;int i=0;
    while(i<a.size()){
        k=moves(a[i]);
        sum+=k;
        cout<<k<<" ";
    i++;}
return sum;}

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