#include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
using namespace std;
#define ll long long
long long a[105];
long long solve(long long x)
{
    if(x==1)
        return 1;
    vector<long> f;
    for(long i = 2;i<= sqrt(x) ;i++)
    {
        while(x%i ==0){
            f.push_back(i);
            x/=i;
        }
    }
    if(x!=1){
        f.push_back(x);
    }
    ll r=1;
    ll ns=0;
    for(int i=f.size()-1;i>=0;i--){
        r=r * f[i];
        ns+= r;
    }
    return (ns+1);
}
int main() {  
    int n;
    cin >> n;
    long long ans=0;
    for (int i = 0; i < n; i++) {
        cin >> a[i];
        ans+=  solve(a[i]);
    }
    cout<<ans<<endl;
}