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 Pascal (FPC 2.6.2) (judge verdict: Accepted)

program Project1;

{$APPTYPE CONSOLE}

uses
  SysUtils,math,classes;
var
  a,h,w,i,j,count,x,y,sw,m,n,b,c,soeji,sum,max,k:Integer;
  l:array of Integer;
  s,s123,s1,s2,s3:string;
  al:string = 'abcdefghijklmnopqrstuvwxyz';
  tf,tfl,tfr,owari:Boolean;
  nyu:TStringList;
begin
  try
    { TODO -oUser -cConsole メイン : ここにコードを記述してください }
    nyu := TStringList.Create;
    Readln(a);
    Readln(s);
    nyu.CommaText := s;
    count:=0;
    owari:=true;
    j:=0;

    while owari do begin
      for i:=j to a-1 do begin
        if strtoint(nyu[i])mod 268435456 = 0 then begin
          nyu[i]:=inttostr(strtoint(nyu[i])div 268435456);
          count:=count+28;
          j:=i;
          break
        end;
        if strtoint(nyu[i])mod 16384 = 0 then begin
          nyu[i]:=inttostr(strtoint(nyu[i])div 16384);
          count:=count+14;
          j:=i;
          break
        end;
        if strtoint(nyu[i])mod 64 = 0 then begin
          nyu[i]:=inttostr(strtoint(nyu[i])div 64);
          count:=count+6;
          j:=i;
          break
        end;
        if strtoint(nyu[i])mod 2 = 0 then begin
          nyu[i]:=inttostr(strtoint(nyu[i])div 2);
          inc(count);
          j:=i;
          break
        end;

        if i=a-1 then
          owari:=false;
      end;
    end;

    Writeln(count);
    Readln;
  except
    on E: Exception do
      Writeln(E.ClassName, ': ', E.Message);
  end;
end.