#include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
using namespace std;
long long arr[1000001];
int main() {  
    int n;
    cin >> n;
    arr[1]=1;
    arr[2]=3;
    for(int i =3 ; i<1000000;i++)
    {
        if(i%2==1)
            arr[i]=i+1;
        else
        {   long long max1 = 0;
            for(int j = 1; j<=sqrt(i)+1 ; j++)
            {
                if(i%j==0)
                {
                    max1 = max(max1,(arr[i/j])*j+1);
                }
            }
            arr[i]=max1;
        }
    }
    //map<long long,long long>mp;
    vector <long long> a(n);
    long long sum = 0;
    for (int i = 0; i < n; i++) {
        cin >> a[i];
        sum+=arr[a[i]];
    }
    cout<<sum<<endl;
  
    /* Enter your code here. Print output to STDOUT */   
 
    return 0;
}