#include <bits/stdc++.h>

using namespace std;
map<long int,long int>m;
long int  h1(long int n)
{
    if(m.count(n)==0)
    {
    if(n%2==0)
    {
        m[n]= n+h1(n/2);
        
    }
    else
    {
        for(int j=3;j<=sqrt(n);j++)
        {
            if(n%j==0)
            {
                m[n]=n+h1(n/j);
                break;
            }
        }
        if(n==1 && m.count(n)==0)
            m[n]=1;
        else if(m.count(n)==0)
        {
            m[n]=n+1;
        }
     
    }
    return m[n];}
    else
        return m[n];
}
long longestSequence(vector <long> a) {
    long int s=0,b[10000];
    long int y=a.size();
    for(long int i=0;i<a.size();i++)
    {
     h1(a[i]);
       s+=m[a[i]]; 
        
    }
    return s;
    //  Return the length of the longest possible sequence of moves.
}

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