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

typedef unsigned long long int ll;

bool isPrime(ll x)
{
    bool f=true;
    
    if(x==1)
     return false;
    
    for(ll i=2;i*i<=x;i++)
    {
        if(x%i==0)
        {
            f=false;
            break;
        }
    }
    
    return f;
}

ll movv(ll x)
{
       if(isPrime(x))
          return x+1;
        else
        {
            ll n=x;ll maxx=n;
            
           while(n>1)
         {
             if(n%2==0)
             {
                 maxx+=n/2;
                 n/=2;
             }
             else
             {
                 int f=0;
                 
                 for(ll i=3;i*i<=n;i+=2)
                 {
                     if(n%i==0)
                     {
                         maxx+=(n/i);
                         n/=i;
                         f=1;
                         break;
                     }
                 }
                 
                 if(f==0)
                 {
                     n=1;
                     maxx+=1;
                 }
             }
         }
               return maxx;
        }
}

    int main() {
    int n;
    cin >> n;

   // seive();
    vector <ll> a(n);
    for (int i = 0; i < n; i++) {
        cin >> a[i];
    }

    /* Enter your code here. Print output to STDOUT */
   // moves();
    ll turns=0;

    for(int k=0;k<n;k++)
    {
        ll maxx=movv(a[k]);
        //cout<<maxx<<endl;
        turns+=maxx;
    }
/*
1
1000000
*/
    cout<<turns<<endl;

    return 0;
}