#include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
#include <unordered_map>
using namespace std;

long long getfor(long long x)
{
    if(x <= 0)
        return 0;
    if(x == 1)
        return 1;
    long long tosum = 1;
    
    vector<long long> pfs;
    long long curfac = 2;
    while(curfac*curfac <= x)
    {
        if(x % curfac == 0)
        {
            pfs.push_back(curfac);
            x = x/curfac;
        }
        else
            curfac ++;
    }
    if(x > 1)
        pfs.push_back(x);
    for(auto n: pfs)
    {
        tosum = tosum * n + 1;
    }
    return tosum;
    
}
int main() {  
    int n;
    cin >> n;
  
    vector <long long> a(n);
    long long total = 0;
    for (int i = 0; i < n; i++) {
        cin >> a[i];
        total += getfor(a[i]);
    }
    cout<<total<<endl;
  
    /* Enter your code here. Print output to STDOUT */   
 
    return 0;
}