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

int main() 
{  
    int n,temp,ans;
    cin >> n;
  
    for (int i = 0; i < n; i++) 
    {
        cin >> temp;
        if(temp%2==0)//even
        {
            ans=temp;
            do
            {
                ans+=temp/2;
                temp/=2;
                
            }while(temp%2!=1)
                
            if(temp==1)
                ans+=1;
            else if(isprime(temp))
                ans+=++temp;
            else
            {
                //find largest multiple until the multiple is a prime
                while(!isprime(temp))
                {
                    
                }
                
            }
        }
    }
  
    if 
    return 0;
}