Problem:
Score: 300 points

Problem Statement

As AtCoder Beginner Contest 100 is taking place, the office of AtCoder, Inc. is decorated with a sequence of length N, a = {a_1, a_2, a_3, ..., a_N}.

Snuke, an employee, would like to play with this sequence.

Specifically, he would like to repeat the following operation as many times as possible:

For every i satisfying 1 \leq i \leq N, perform one of the following: "divide a_i by 2" and "multiply a_i by 3".
Here, choosing "multiply a_i by 3" for every i is not allowed, and the value of a_i after the operation must be an integer.

At most how many operations can be performed?

Constraints

N is an integer between 1 and 10 \ 000 (inclusive).

a_i is an integer between 1 and 1 \ 000 \ 000 \ 000 (inclusive).

Input

Input is given from Standard Input in the following format:

N
a_1 a_2 a_3 ... a_N

Output

Print the maximum number of operations that Snuke can perform.

Sample Input 1

3
5 2 4

Sample Output 1

3

The sequence is initially {5, 2, 4}. Three operations can be performed as follows:

First, multiply a_1 by 3, multiply a_2 by 3 and divide a_3 by 2. The sequence is now {15, 6, 2}.

Next, multiply a_1 by 3, divide a_2 by 2 and multiply a_3 by 3. The sequence is now {45, 3, 6}.

Finally, multiply a_1 by 3, multiply a_2 by 3 and divide a_3 by 2. The sequence is now {135, 9, 3}.

Sample Input 2

4
631 577 243 199

Sample Output 2

0

No operation can be performed since all the elements are odd. Thus, the answer is 0.

Sample Input 3

10
2184 2126 1721 1800 1024 2528 3360 1945 1280 1776

Sample Output 3

39

Solution in C# (Mono 4.6.2.0) (judge verdict: Wrong Answer)

using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;
using System.Threading.Tasks;

namespace test
{
    class Program
    {
        static void Main(string[] args)
        {
            var N = int.Parse(Console.ReadLine());
            var a = Console.ReadLine().Split(' ').Select(s => int.Parse(s)).ToArray();
            var odd = new List<int>();
            var even = new List<int>();
            for(var i = 0; i < a.Length; i++)
            {
                if (a[i] % 2 != 0) odd.Add(a[i]);
                else even.Add(a[i]);
            }
            var ans = 0;
            var suc = true;

            while (even.Count > 0)
            {
                for(var i = 0; i < odd.Count; i++)
                {
                    odd[i] *= 3;
                    if (odd[i] > 1000000000) suc = false;
                }

                var divI = -1;
                var div = -1;

                for(var i = 0; i < even.Count; i++)
                {
                    var tmp = even[i] * 3 / 2;
                    if (tmp % 2 == 0)
                    {
                        if (div < even[i])
                        {
                            divI = i;
                            div = even[i];
                        }
                    }
                }

                if (divI == -1)
                {
                    for (var i = 0; i < even.Count; i++)
                    {
                        if (even[i] > div)
                        {
                            divI = i;
                            div = even[i];
                        }
                    }
                }

                even.Insert(even.Count, div);
                even.RemoveAt(divI);

                for (var i = 0; i < even.Count - 1; i++)
                {
                    even[i] *= 3;
                    if (even[i] > 1000000000) suc = false;
                }

                even[even.Count - 1] /= 2;
                if (even[even.Count - 1] % 2 != 0)
                {
                    odd.Add(even[even.Count - 1]);
                    even.RemoveAt(even.Count - 1);
                }

                if (suc) ans++;
                else break;
            }

            Console.WriteLine(ans);
        }
    }
}