#include <bits/stdc++.h>

using namespace std;

long long int  longestSequence(vector <long long int > a)
{
    long long int sum=0;
    for(int i=0;i<a.size();i++)
    {
        if(a[i]==1)
        {
            sum+=1;
            continue;
        }
        long long int t=a[i];
        long long int r=1;
        for(long long int j=2;j*j<=t;j++)
        {
            if(a[i]%j==0)
            {
                while(a[i]%j==0)
                {
                    a[i]/=j;
                   r=r*j+1;
                }
            }
        }
        if(a[i]==1)
        sum+=r;
        else
        sum+=r*a[i]+1;
    }
    return sum;
}

int main() {
    int n;
    cin >> n;
    vector<long long int> a(n);
    for(int a_i = 0; a_i < n; a_i++){
       cin >> a[a_i];
    }
    long long int result = longestSequence(a);
    cout << result << endl;
    return 0;
}