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

bool check_prime(long long n)
{
    if (n <= 1)  return false;
    if (n <= 3)  return true;

    if (n%2 == 0 || n%3 == 0) return false;
 
    for (long i=5; i*i<=n; i=i+6)
        if (n%i == 0 || n%(i+2) == 0)
           return false;
 
    return true;
}
int least_div(long long num)
{
    int ans=1;
    while(num%2==0)
    {
          ans=2;
        break;
     }
    if(ans==2)
        return ans;
    for (int i = 3; i <= sqrt(num); i = i+2)
    {
        while (num%i == 0)
        { 
            ans=i;
            break;
         }
        if(ans==i)
            break;
    }
    return ans;
}
/*
long long count_moves(long long num,int first)
{
    long long sum=0,factor,n,ans_num=1;
    int i=0;
    n=num;
    while(ans_num>0)
    {
        factor=pow(first,i);
        //num=num/factor;
        ans_num=n/factor;
        //cout<<ans_num<<" ";
        sum=sum+ans_num;
        i++;
    }
    return sum;
} */
long long count_move(long long num)
{
    long long sum=0;
    if(num==1)
        return 1;
    else if(check_prime(num))
        return num+1;
    else 
    {
        int factor=least_div(num);
        while(num!=0)
        {
            if(num&1)
            {
                sum=sum+num;
                num=num/factor;
            }
            else
            {
                sum=sum+num;
                num=num/2;
            }
        }
    }
    return sum;
}
int main() {  
    int n;
    cin >> n;
      long long a[n];
    for (int i = 0; i < n; i++) {
        cin >> a[i];
    }
    long long count=0;
    /*long long count=0;
    for(int i=0;i<n;i++)
    {
        int first_prime=factor_prime(a[i]);
         count+=count_moves(a[i],first_prime);
    }
     cout<<count;*/
    /* Enter your code here. Print output to STDOUT */   
      for(int i=0;i<n;i++)
      {
          
          count+=count_move(a[i]);
      }
    cout<<count;
    return 0;
}