#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#include <bits/stdc++.h>

using namespace std;

ll longestSequence(ll n)
{
    if(n==1)
    {
        return 1;
    }
    ll sum=n+1;
    while(n%2==0)
    {
        n=n/2;
        if(n>1)
        {
            sum+=n;
            //cout<<n<<endl;
        }
    }
    for (ll i = 3; i*i <= n; i = i+2)
    {
        while (n%i == 0)
        {
            n = n/i;
            if(n>1)
            {
                sum+=n;
                //cout<<n<<endl;
            }
        }
    }
    return sum;
}

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