Problem:


Score : 200 points

Problem Statement

There are N positive integers written on a blackboard: A_1, ..., A_N.

Snuke can perform the following operation when all integers on the blackboard are even:

Replace each integer X on the blackboard by X divided by 2.

Find the maximum possible number of operations that Snuke can perform.

Constraints

1 \leq N \leq 200

1 \leq A_i \leq 10^9

Input

Input is given from Standard Input in the following format:

N
A_1 A_2 ... A_N

Output

Print the maximum possible number of operations that Snuke can perform.

Sample Input 1

3
8 12 40

Sample Output 1

2

Initially, [8, 12, 40] are written on the blackboard.
Since all those integers are even, Snuke can perform the operation.

After the operation is performed once, [4, 6, 20] are written on the blackboard.
Since all those integers are again even, he can perform the operation.

After the operation is performed twice, [2, 3, 10] are written on the blackboard.
Now, there is an odd number 3 on the blackboard, so he cannot perform the operation any more.

Thus, Snuke can perform the operation at most twice.

Sample Input 2

4
5 6 8 10

Sample Output 2

0

Since there is an odd number 5 on the blackboard already in the beginning, Snuke cannot perform the operation at all.

Sample Input 3

6
382253568 723152896 37802240 379425024 404894720 471526144

Sample Output 3

8



Sample input:
3
8 12 40


Sample output:
2

Submission status: Wrong Answer

Solution code:
N = int(input())
A = list(map(int,input().split()))
k = 0
for i in range(0,N):
  if A[i] % 2 == 0:
    k = k + 1
  else:
    k
print(k)

Submission status: Wrong Answer

Solution code:
N = int(input())
A = list(map(int,input().split()))
k = 0
for i in range(0,N-1):
  if A[i] % 2 == 0:
    k = k + 1
  else:
    k
print(k)

Submission status: Wrong Answer

Solution code:
num = input()

l = list(map(int, input().split()))

total = 0

while True:
  b_flag = False
  for i in range(len(l)):
    if l[i] % 2 == 1:
      b_flag = True
      break;
    else:
      l[i] /= 2
      total += 1
  if b_flag:
    break

print(total)

Submission status: Wrong Answer

Solution code:
num = int(input())
listName = list(map(int, input().split()))

counter = 0
while (len(listName) == num):
    listName = [i /  2 for i in listName if i%2 == 0]
    print(listName)

    counter += 1
print(counter - 1)

Submission status: Wrong Answer

Solution code:
a = list(map(int, input().split()))
cnt = 0

while all(i%2==0 for i in a):
         a = [i/2 for i in a]
         cnt += 1
         print(cnt)

Submission status: Wrong Answer

Solution code:
n = int(input())
s_list = list(map(int, input().split()))

count = 0
next = 1
while(next==1):
  flag = 0
  next = 0
  for s in s_list:
    if s%2:
      flag += 1
if flag == n:
  next = 1
  count += 1
  for s in s_list:
    s = s/2
          
print(count)

Submission status: Wrong Answer

Solution code:
s=map(int,input().split())
s=map(int,input().split())
ans = []
for i in s:
    tmp=i
    count=0
    while(1):
        if tmp%2==0:
            tmp=tmp/2
            count=count+1
        else:
            break
    ans.append(count)
min(ans)

Submission status: Wrong Answer

Solution code:
s=map(int,input().split())
ans = []
for i in s:
    tmp=i
    count=0
    while(1):
        if tmp%2==0:
            tmp=tmp/2
            count=count+1
        else:
            break
    ans.append(count)
print(min(ans))

Submission status: Wrong Answer

Solution code:
s=map(int,input().split())
ans = []
for i in s:
    tmp=i
    count=0
    while(1):
        if tmp%2==0:
            tmp=tmp/2
            count=count+1
        else:
            break
    ans.append(count)
min(ans)

Submission status: Wrong Answer

Solution code:
N=int(input())
list=[]
list=[int(x) for x in input().split()]
M=0
i=0
while(1):
  if list[i]%2==0:
    list[i]=list[i]/2
  else:
    break
  M+=1
  if i==N-1:
    i=0
print(M)

Submission status: Wrong Answer

Solution code:
N=int(input())
list=[]
list=[int(x) for x in input().split()]
M=0
for i in range(N):
	if list[i]%2==0:
		list[i]=list[i]/2
		M+=1
	else:
		break
print(M)

Submission status: Wrong Answer

Solution code:
N = int(input().rstrip())
INPUT = list(map(int, input().rstrip().split(' ')))

for count in range(10):
    for i in range(N):
        p, mod = divmod(INPUT[i], 2)
        if mod == 0:
            INPUT[i] = p
        else:
            break
    else:
        continue
    print(count)
    break

Submission status: Wrong Answer

Solution code:
n=int(input())
a=list(map(int, input().split()))
t=0
g=0
for i in range(n):
    while a[i]%2==0:
        t+=1
        a[i]=a[i]//2
    if g==0:
        g=t
    else:
        g=min(g,t)
    t=0
print(g)

Submission status: Wrong Answer

Solution code:
n=int(input())
a=list(map(int, input().split()))
t=0
g=0
for i in range(n):
  while a[i]%2==0:
    t+=1
    a[i]=a[i]//2
  if g==0:
    g=t
  else:
    g=min(g,t)
print(g)

Submission status: Wrong Answer

Solution code:
A = list(map(int, input().split()))
count = 0
while all(a % 2 == 0 for a in A):
    A = [a/2 for a in A]
    count += 1
print(count)

Submission status: Wrong Answer

Solution code:
import sys as a
N=int(input())
A=list(map(int,input().split()))
cnt=0
for i in range(1000010):
    for j in range(N):
        if A[j]%2==0:
            A[j]/2
        elif A[j]%2!=0:
            a.exit()
    cnt+=1
print(cnt)

Submission status: Wrong Answer

Solution code:
N=int(input())
A_list = [int(A_i) for A_i in input().split()]
b = min(A_list)
counter=0
while b%2==0:
  b = b//2
  counter+=1
print(counter)

Submission status: Wrong Answer

Solution code:
N=int(input())
A_list = [int(A_i) for A_i in input().split()]
b = min(A_list)
counter=0
while b%2 ==0:
  b /= 2
  counter+=1
print(counter)

Submission status: Wrong Answer

Solution code:
N = int(input())
A = list(map(int, input().split()))
B = [ ]
c = 0
for i in A:
  B.append(list(bin(i)))
for i in range(10000):  
  for j in range(N):
    if B[j][-i-1] == '0':
      continue
    else:
      c = i
      break
  if c == 1 and j == 1:
    print(0)
    break
  elif c>0:
    print(i)
    break

Submission status: Wrong Answer

Solution code:
n = int(input())
N = list(map(int,input().split()))
ans = 0
c = True
while c == True :
  for i in range(n):
    if N[i] % 2 == 1:
      c = False
    else:
      N[i] = int(N[i] / 2)
      c = True
  if c == True:
    ans += 1

print(ans)

Submission status: Wrong Answer

Solution code:
N=int(input())
A=list(map(int,input().split()))
K=0
for i  in range(1,N):
    for j in A:
        if j%(2**i)!=0:
            break
    else:
        K+=1
        continue
    break

print(K)

Submission status: Wrong Answer

Solution code:
n = int(input(">>"))
a = map(int, input(">>").split())

count = 0
flag = True

while(flag):
    tmp_a = []
    for i in a:
        if i % 2 !=0:
            flag = False
            break
        tmp_a.append(i/2)
    a = tmp_a
    if flag == True:
        count += 1

print(count)

Submission status: Wrong Answer

Solution code:
N = input()
A = input()
A[int(N)]
number = A.split()

count = 0
while True:
  for i in range(len(number)):
    if int(number[i]) % 2 == 0:
      number[i] = int(number[i])/2
    else:
      break
  if int(number[i]) % 2 != 0:
    break
  count += 1
print(count)

Submission status: Wrong Answer

Solution code:
n = int(input())
a = map(int,input().split())
ans = 0
count = 0
for i in a:
    while i%2 ==0:
        i /= 2
        count += 1
    if count > ans:
        ans = count
    count = 0
print(ans)

Submission status: Wrong Answer

Solution code:
import math

N=int(input())
a = input().split()
a_num= [int(s) for s in a]

count=0
while True:
    for i in range(len(a_num)):
        print(a_num[i],a_num[i]%2,math.floor(a_num[i]/2))
        
        a_num[i]=math.floor(a_num[i]/2)
    print("========")    
    count +=1
    if a_num[i]%2 != 0:
        print ("it's 1!")
        break
print(count-1)

Submission status: Wrong Answer

Solution code:
N = input()
A = list(map(int,input().split()))
count = 0
exist_odd = False

while (exist_odd == False):
  for x in A:
    if x % 2 != 0:
      exist_odd = True
      
  if exist_odd == True:
    break
  else:
    A = [x-1 for x in A]
  count += 1
print(count)

Submission status: Wrong Answer

Solution code:
N = input()  #一応読むけど、ループ回せば不要では
aList=input().split()

opCnt = 0
isAllE = True  #奇数見つかるまでは見なしTrue

while isAllE:
  for a in aList:
    if int(a)%2 == 1:
      isAllE = False
  else:
    opCnt = opCnt + 1
    for i,a in enumerate(aList):
      aList[i] = int(int(a)/2)

print(opCnt)

Submission status: Wrong Answer

Solution code:
nums = [int(i) for i in input().split()]
ans = 0
while True:
    if [i for i in nums if i % 2 == 1]:
        break
    nums = [i//2 for i in nums]
    ans += 1
print(ans)

Submission status: Wrong Answer

Solution code:
def howmanytimesdisible(n):
  ans = 0
  while n%2==0:
    n/=2
    ans+=1
  return ans

n = int(input())
li = list(map(int,input().split()))	

ans = min(map(howmanytimesdisible,li))

Submission status: Wrong Answer

Solution code:
A=list(map(int,input().split()))
A
count=0
while all([a%2==0 for a in A]):
    A = [a/2 for a in A]
    count+=1
print(count)

Submission status: Wrong Answer

Solution code:
N = int(input())
A = list(map(int,input().split()))
n = 0
can = True

while can:
    #すべてが偶数か確認
    for i in range(N):
        if A[i] % 2 == 0:
            continue
        else:
            can = False
            break

    for i in range(N):
        A[i] = A[i]/2
    n += 1


print(n)

Submission status: Wrong Answer

Solution code:
N = int(input())
A = list(map(int,input().split()))
n = 0
can = True

while can:
    #すべてが偶数か確認
    for i in range(N):
        if A[i] % 2 == 0:
            continue
        else:
            can = False
            break

    if A[i] % 2 == 0:
        A[i] = A[i]/2
    
    n += 1


print(n)

Submission status: Wrong Answer

Solution code:
N = int(input())
A = list(map(int,input().split()))
n = 0
can = True

while can:
    #すべてが偶数か確認
    for i in range(N):
        if A[i] % 2 == 0:
            continue
        else:
            can = False
            break

    if A[i] % 2 == 0:
        A[i] = A[i]/2
        n += 1


print(n)

Submission status: Wrong Answer

Solution code:
N = int(input())
A = list(map(int,input().split()))
n = 0
can = True

while can:
    for i in range(N):
        if A[i]%2 != 0:
            can = False
            break

        if A[i]%2 == 0:         
            A[i] = A[i] // 2
            n += 1
        else:
            can = False
            break

print(n)

Submission status: Wrong Answer

Solution code:
N = int(input())
A = list(map(int,input().split()))
n = 0
can = True

while can:
    for i in range(N):
        if A[i]%2 == 1:
            can = False
            break

        if A[i]%2 == 0:         
            A[i] = A[i] // 2
            n += 1

        else:
            can = False
            break

print(n)

Submission status: Wrong Answer

Solution code:
N = int(input())
A = list(map(int,input().split()))
n = 0
can = True

while can:
    for i in range(N):
        if A[i]%2 == 1:
            can = False
            break

        if A[i]%2 == 0:         
            A[i] = A[i] // 2
            n += 1

print(n)

Submission status: Wrong Answer

Solution code:
N = int(input())
A = list(map(int,input().split()))
n = 0
can = True

while can:
    for i in range(N):
        if A[i]%2 == 0:
            A[i] = A[i] // 2
            n += 1
        else:
            can = False
            break

print(n)

Submission status: Wrong Answer

Solution code:
N = int(input())
A = list(map(int,input().split()))
n = 0
can = True

while can:
    for i in range(N):
        if A[i]%2 == 0:
            A[i] = (A[i]/2)
            n += 1
        if A[i]%2 == 1:
            can = False
            break

print(n)

Submission status: Wrong Answer

Solution code:
N = int(input())
A = list(map(int,input().split()))
n = 0
can = True

while can:
    for i in range(N):
        if A[i]%2 == 0:
            A[i] = (A[i]/2)
            n += 1
        else:
            can = False
            break

print(n)

Submission status: Wrong Answer

Solution code:
N = int(input())
A = list(map(int, input().split()))
count = 0
for k in range(0, 5*10**8):
    for i in A:
        if i%2==0:
            count += 1
            i = i//2
    else:
        break
print(count)

Submission status: Wrong Answer

Solution code:
N = int(input())
A = [int(i) for i  in input().split()]
count = 0 
can = True
while can:
  count += 1
  for i in range(N):
    if A[i]%2 == 0:
      A[i] = int(A[i]/2)
    else:
      count-=0
      can = False
      break
print(count)

Submission status: Wrong Answer

Solution code:
N = int(input())
A = [int(i) for i in input().split()]
en = 0
con = True
while con :
	en += 1
	for i in range(N) :
		if A[i] % 2 == 0 :
			A[i] = int( A[i] / 2 ) 
		else :
			en -= 1
			con = False
print(en)

Submission status: Wrong Answer

Solution code:
n=int(input())
a=list(map(int,input().split()))

for A in a:
    cnt=-1
    while A % 2==0: #すべてが偶数の時しか実行されない
        A=A//2
        cnt=cnt+1

print(cnt)

Submission status: Wrong Answer

Solution code:
n=int(input())
a=list(map(int,input().split()))

for A in a:
    cnt=0
    while A % 2==0:
        A=A//2
        cnt=cnt+1

print(cnt)

Submission status: Wrong Answer

Solution code:
n = int(input())
x = input().split()
count = 0
flg = 0
while True:
  for i in range(0, n):
    if int(x[i]) % 2 != 0:
      flg = 1
      break
  if flg == 0:
    count += 1
    x.insert(i, int(x[i]) /2)
  else:
    break
print(count)

Submission status: Wrong Answer

Solution code:
n = int(input())
x = input().split()
count = 0
flg = 0
while True:
  for i in range(0, n):
    if int(x[i]) % 2 != 0:
      flg = 1
  count += 1
  if flg == 0:
    x.insert(i, int(x[i]) /2)
  else:
    break
print(count)

Submission status: Wrong Answer

Solution code:
def resolve():
    N = int(input())
    mval = min(list(map(int, input().split(" "))))
    cnt = 0
    while True:
        if mval % 2 == 0:
            mval = mval // 2
            cnt += 1
        else:
            break
    print(cnt)

            

if '__main__' == __name__:
    resolve()

Submission status: Wrong Answer

Solution code:
import math
N = int(input())
A = list(map(int, input().split())) 

res = 1000
for a in A:
    print('a:', a)
    cnt = 0
    while a%2 == 0:
        a = (a//2)
        cnt += 1
        print(' ->', a, '(cnt:', cnt, ')')
    print(' cnt:', cnt)
    res = min(res, cnt)
    print(' res:', res)
print(res)

Submission status: Wrong Answer

Solution code:
n = input()
a = list(map(int, input().split()))
ans = float('inf')
for i in a:
    ans = min(ans, len(bin(i)) - bin(i).rfind('1') - 1)

Submission status: Wrong Answer

Solution code:
num = int(input())
line = list(map(int,input().split()))
count = True
count_num = 0
while count:
    for i in range(num):
        if line[i] % 2 != 0:
            count = False
    if count:
        for i in range(num):
            line[i] /= 2
    count_num += 1     
print(count_num)

Submission status: Wrong Answer

Solution code:
n = int(input())
x = input().split()
count = 0
flg = 0
while True:
  for i in range(0, n):
    if int(x[i]) % 2 != 0:
      flg = 1
  if flg == 0:
    count += 1
    x.insert(i, int(x[i]) /2)
  else:
    break
print(count)

Submission status: Wrong Answer

Solution code:
n = int(input())
x = input().split()
a = int(x[0])
b = int(x[1])
c = int(x[2])
count = 0
for i in range(0, n):
  if a % 2 == 0 and b % 2 == 0 and c % 2 == 0:
    count += 1
    list = []
    a = a /2
    b = b /2
    c = c /2
  else:
    break
print(count)

Submission status: Wrong Answer

Solution code:
x = input()
list = x.split()
count = 0
for i in list:
  if int(i) % 2 == 0:
    count += 1
    list = []
    list.append(i)
  else:
    break
print(count)

Submission status: Wrong Answer

Solution code:
import numpy

Submission status: Wrong Answer

Solution code:
# ABC 081: B – Shift only
n = int(input())
a = [int(s) for s in input().split()]

m = 0
canDivided = True

while canDivided:
    for i in range(len(a)):
        if a[i] % 2 == 0:
            a[i] //= 2
        else:
            canDivided = False
            break
    else:
        m += 1

Submission status: Wrong Answer

Solution code:
N=int(input())
A=list(map(int,input().split()))
mini=100100100100
for i in range(N):
  a=i
  c=0
  while a%2!=0:
    a//=2
    c+=1
    if mini>c:
      mini=c
print(mini)

Submission status: Wrong Answer

Solution code:
n=int(input())
a=list(map(int,input().split()))

x=0
if sum(a)%2==0:
    A=[]
    for i in range(n):
        x=0
        for j in range(10**5):
            a[i]//=2
            x+=1
            if a[i]%2!=0:
                A.append(x)
                break
    print(min(A))
else:
    print(0)

Submission status: Wrong Answer

Solution code:
n=int(input())
a=list(map(int,input().split()))

x=1
if sum(a)%2==0:
    for i in range(10**5):
        a=[l//2 for l in a]
        if sum(a)%2==0:
            x+=1
        else:
            break
    print(x)
else:
    print(0)

Submission status: Wrong Answer

Solution code:
print('a')

Submission status: Wrong Answer

Solution code:
num = int(input())
l = list(map(int, input().split()))
count=0
flag = True

while flag:
    for elmnt in l:
        if elmnt%2 != 0:
            flag = False
            break
        elmnt/=2
    count+=1

print(count)

Submission status: Wrong Answer

Solution code:
n=int(input())
a=list(map(int,input().split()))
d=[]
for c in range(n):
  b=0
  while a[c]%2==0:
    a[c]=int(a[c]//2)
    b+=1
  d.append(b)
print(max(d))

Submission status: Wrong Answer

Solution code:
n=int(input())
a=list(map(int,input().split()))
d=[]
for c in range(n):
  b=0
  while a[c]%2==0:
    a[c]=int(a[c]/2)
    b+=1
  d.append(b)
print(max(d))

Submission status: Wrong Answer

Solution code:
N = int(input())
A = list(map(int,input().split()))

ans = 0

for a in A:
    if a % 2 == 0:
        ans += 1
    else:
        print(0)
        exit()
        
print(ans)

Submission status: Wrong Answer

Solution code:
N = int(input())
A = list(map(int, input().split()))
print(A)
count = 0
while all(a % 2 == 0 for a in A):
    A = [a/2 for a in A]
    count +=1
    print(A)
print(count)

Submission status: Wrong Answer

Solution code:
import numpy as np

A = list(map(int,input().split()))
count = 0

while all(a % 2 == 0 for a in A):
  A = [a/2 for a in A]
  count += 1
  
print(count)

Submission status: Wrong Answer

Solution code:

n = int(input())
a = list(map(int,input().split()))

a_min = min(a)
ans = 0
for _ in range(10000000):
    if a_min%2 == 0 and a_min > 0:
        ans += 1
        a_min = a_min//2
        continue
    else:
        break

for y in a:
    if y%2==1:
        ans -= 100000000
        continue



if ans > 0:
    print(ans)
else:
    print(0)

Submission status: Wrong Answer

Solution code:
n = int(input())
a_list = list(map(int,input().split()))
count = 0
for j in range(30):
  for a in a_list:
    frag = True
    if a % 2 !=0:
      frag = False
  if frag == False:
    print(count)
    break
  else:
    count += 1
    for i in range(n):
      a_list[i] = a_list[i]//2

Submission status: Wrong Answer

Solution code:
import numpy as np

_ = int(input())
num_array = np.array(list(map(int, input().split())))
print(num_array)

count = 0
while True:
    if any(num_array % 2 != 0):
        break
    num_array = num_array / 2
    count += 1
print(count)

Submission status: Wrong Answer

Solution code:
_ = int(input())

num_list = list(map(int, input().split()))
print(num_list)

count = 0
is_all_even = None 
while True:
    for num in num_list:
        if num % 2 != 0:
            is_all_even = False
            break
    if is_all_even is not None:
        break
    count += 1
    num_list = list(map(lambda x: x / 2, num_list))
print(count)

Submission status: Wrong Answer

Solution code:
a = int(input())

list=input().split()
list=[int(i) for i in list]

count =0 
counts=0
flag= True
new=[]

while flag==True:
  check=list
  if count>0:
    check=new
    new=[]
  for i in check:
    if i%2 != 0:
      if counts>0:
        print(count)
        count+=1
      flag=False
      break
    i//=2
    new.append(i)
    counts+=1
    if counts==a:
      counts=0
      count+=1
      break

Submission status: Wrong Answer

Solution code:
# -*- coding: utf-8 -*-
 
N = int(input())
a = list(map(int, input().split(" ")))
c = []
 
for i in a:
  count = 0
  while not(i % 2):
    i = int(i / 2)
    count += 1
    c.append(count)
print(min(c))

Submission status: Wrong Answer

Solution code:
#import itertools
#import fractions
#import numpy as np
#mod = 10**4 + 7
"""def kiri(n,m):
  r_ = n / m
  if (r_ - (n // m)) > 0:
    return (n//m) + 1
  else:
    return (n//m)"""

# Written by NoKnowledgeGG @YlePhan

#import math
#mod = 10**9+7



def main():
  n = int(input())
  a = list(map(int,input().split()))
  cnt = 0
  while True:
    for i in range(3):
      if a[i] % 2 == 0:
        a[i] //= 2
      else:
        print(cnt)
        exit()
    cnt += 1
  
  
if __name__ == '__main__':
  main()

Submission status: Wrong Answer

Solution code:
from fractions import gcd
from functools import reduce
def gcds(num):
    return reduce(gcd,num)
n = int(input())
a = list(map(int, input().split()))
x = gcds(a)//2
ans = 0
while x%2 == 0:
    x //= 2
    ans += 1
print(ans)

Submission status: Wrong Answer

Solution code:
n = int(input())
a = list(map(int,input().split()))

ans = []

for i in range(n):
    tmp = a[i]
    cnt = 0
    for _ in range(1000):
        tmp = tmp // 2
        cnt +=1
        if tmp % 2 != 0:
            ans.append(cnt)
            break
print(min(ans))

Submission status: Wrong Answer

Solution code:

import math
import itertools
import statistics
#import numpy as np
#import collections

n = int(input())
a = list(map(int, input().split()))

s = sum(a)
count = 0
while s%2==0:
    for i in range(n):
        a[i] //= 2
    count += 1
    s = sum(a)

print(count)

Submission status: Wrong Answer

Solution code:

import math
import itertools
import statistics
#import numpy as np
#import collections

n = int(input())
a = list(map(int, input().split()))

s = sum(a)
count = 0
while s%2==0:
    for i in range(n):
        a[i] /= 2
    count += 1
    s = sum(a)

print(count)

Submission status: Wrong Answer

Solution code:
a = int(input())
b = list(map(int, input().split()))

cnt = 0
endflag = False

while(True):
  for i in range(0,a):
    if ((b[i] %2 ) == 0):
      b[i] = b[i] / 2
    else:
      endflag = True
      break
  cnt = cnt + 1
  if (endflag):
    break

print(cnt)

Submission status: Wrong Answer

Solution code:
a = int(input())
b = list(map(int, input().split()))

cnt = 0
endflag = False

while(True):
  for i in range(0,a):
    if ((b[i] %2 ) == 0):
      b[i] = b[i] / 2
    else:
      endflag = True
  if (endflag):
    break

print(cnt)

Submission status: Wrong Answer

Solution code:
N=int(input())
A=list(map(int, input().split()))
B=[]
for i in A:
  B.append(int(i**0.5))

print(min(B))

Submission status: Wrong Answer

Solution code:
input()
a = list(map(int, input().split()))
counter = 0
while counter < 10:
    if all([(i % 2 == 0) for i in a]):
        a = [int(i / 2) for i in a]
        counter += 1
    else:
        break
print(counter)

Submission status: Wrong Answer

Solution code:
n=int(input())
a=list(map(int,input().split()))
 
count=0
ans=a[0]
for i in range(n):
  count=0
  while(a[i]%2==0):
    a[i]=a[i]//2
    count+=1
  print(count)
  ans=min(ans,count)
  
print(ans)

Submission status: Wrong Answer

Solution code:
n=int(input())
a=list(map(int,input().split()))

count=0
ans=0
for i in range(n):
  count=0
  while(a[i]%2==0):
    a[i]=a[i]//2
    count+=1
  ans=max(ans,count)
  
print(ans)

Submission status: Wrong Answer

Solution code:
N=str(input())
s=list(map(int,input().split()))
ans=0
for i in s:
  if i%2==0:
    ans+=1
    i//=2
print(ans)

Submission status: Wrong Answer

Solution code:
N = int(input())
a = list(map(int,input().split()))
counter = 0
def division(a):
  global counter
  flag = 1
  for i in range(len(a)):
    if a[i] %2 != 0:
      flag = 0
    else:
      a[i] /= 2
  if flag ==  1:
    counter += 1
for i in range(10):
  division(a)
print(counter)

Submission status: Wrong Answer

Solution code:
N = int(input())
num = list(map(int, input().split(" ")))
oparation = 10 ^ 8

for i in range(N):
    temp = 0
    while(1):
        if(num[i] % 2 or num[i] == 0):
            break
        else:
            num[i] /= 2
            temp += 1
    if(oparation > temp):
        oparation = temp

print(oparation)

Submission status: Wrong Answer

Solution code:
a = input()
num = list(map(int,input().split()))
count = 0

while not any([n%2 for n in num]):
    num = [n/2 for n in num]
    print(num)
    count += 1
print(count)

Submission status: Wrong Answer

Solution code:
N = input()
num = list(map(int,input().split()))
count = 0

while not all([n%2 for n in num]):
    num = [n/2 for n in num]
    count += 1
print(count)

Submission status: Wrong Answer

Solution code:
num = list(map(int,input().split()))
count = 0

while not all([n%2 for n in num]):
    num = [n/2 for n in num]
    count += 1
print(count)

Submission status: Wrong Answer

Solution code:
n=int(input())
l=list(map(int,input().split()))
c=0
while True:
    for i in range(n):
        if l[i]%2 !=0:
            print(c)
            exit(0)
        else:
            l[i] = l[i]//2
            c+=1

Submission status: Wrong Answer

Solution code:
N=int(input())
An=list(map(int, input().rstrip().split()))
cnt=0
while True:
    if len(list(filter(lambda a:(a+1)%2, An))) < len(An):
        break
    An=list(map(lambda a:int(a/2), An))
    print(An)
    cnt+=1
print(cnt)

Submission status: Wrong Answer

Solution code:
len_target = input()
target = [int(x) for x in input().split()]

count=0
for t in target:
	if t%2==0:
		count+=1
		while t%2==0:
			t = t//2
			count+=1
	elif t%2==1:
		print(0)
	else:
		print(count)

Submission status: Wrong Answer

Solution code:
N = int(input())
A = list(map(int,input().split()))
j = True
count = 0
while j :
     for i in A:
             if i % 2 == 0 or i == 0:
                     A[A.index(i)] = i / 2
             else:
                     j = False
     count += 1
print(count)

Submission status: Wrong Answer

Solution code:
N = int(input())
A = list(map(int,input().split()))
j = True
count = 0
while j:
     for i in A:
             if i % 2 == 0:
                     A[A.index(i)] = i / 2
             else:
                     j = False
     count += 1
print(count)

Submission status: Wrong Answer

Solution code:
n=int(input())
a=list(map(int,input().split()))
cnt=0
s=sum(a)

while s%2==0:
    cnt+=1
    s=s//2
print(cnt)

Submission status: Wrong Answer

Solution code:
n = input()
A = [int(i) for i in input().split()]

odd_flag = False
count = 0
while True:
    for i, j in enumerate(A):
        if j % 2 == 1:
            odd_flag = True
            break
        A[i] = j / 2
    if not odd_flag:
        count += 1
    else:
        break

Submission status: Wrong Answer

Solution code:
N = int(input())
A = list(map(int, input().split()))

counter_min = 9
for a in A:
    counter = 0
    while a%2 == 0:
        a /= 2
        counter += 1
    if counter < counter_min:
        counter_min = counter

print(counter_min)

Submission status: Wrong Answer

Solution code:
N = int(input())
A = list(map(int, input().split()))


counter_min = 10^9
for a in A:
    counter = 0
    while a%2 == 0:
        a /= 2
        counter += 1
    if counter < counter_min:
        counter_min = counter

print(counter_min)

Submission status: Wrong Answer

Solution code:
N= int(input())
A=list(map(int,input().split()))
count = 0
while True:
	for i in range(0,N):
		A[i]=A[i]/2
	count +=1
	if A[i]%2 !=0:
			break
print(count)

Submission status: Wrong Answer

Solution code:
n = int(input())
List=list(map(int,input().split()))
result = 0


for i in range(n):
	for j in range(n):
		if List[j]%2 != 0:
			break
		List[j] /= 2

	else:
		result += 1
		continue
	break
  
print(result)

Submission status: Wrong Answer

Solution code:
N = int(input())
# スペース区切りの整数の入力 リスト
A = list(map(int, input().split()))
count = 0

for j in range(1,1000000000):
    odd_flag = True

    while odd_flag:
        for i in range(0,len(A)): #len(A)配列の要素数を整数値で返す
            if A[i] % 2 == 0:
                A[i] = A[i]/2
            else:
                odd_flag = False
                break
    count+=1
    break

print(count)

Submission status: Wrong Answer

Solution code:
# 整数の入力
N = int(input())
# スペース区切りの整数の入力 リスト
A = list(map(int, input().split()))
count = 0


for j in range(1,1000000):
    odd_flag = True

    while odd_flag:
        for i in range(0,len(A)): #len(A)配列の要素数を整数値で返す
            if A[i] % 2 == 0:
                A[i] = A[i]/2
            else:
                odd_flag = False


count+=1


print(count)

Submission status: Wrong Answer

Solution code:
import sys

Row=int(input())
List = [int(j) for j in input().split()]

for i in range(len(List)):
    ans = List[i] % 2
    if ans == 1:
        print(0)
        sys.exit()

minVal = min(List)
count = 0
while minVal%2 == 0:
    count = count + 1
    minVal = minVal/2

print(count)

Submission status: Wrong Answer

Solution code:
li = list(map(int, input().split()))
count = 0
while True:
    if [x for x in li if x % 2 == 1]:
        break
    for i in li:
        i = i / 2
    count += 1
print(count)

Submission status: Wrong Answer

Solution code:
li = list(map(int, input().split()))
count = 0
for x in li:
    if x % 2 == 0:
        count += 1
        x = x / 2
    else:
        count = 0
        break
print(count)

Submission status: Wrong Answer

Solution code:
def resolve():
    n = int(input())
    arr = (int(x) for x in input().split())

    res = 0
    while True:
        even = list(filter(lambda x: x%2 == 0, arr))
        if len(even) > 0:
            res += 1
        else:
            print(res)
            return

resolve()

Submission status: Wrong Answer

Solution code:
n = int(input())
a = list(map(int, input().split()))
cnt = 0

list_sum = sum(a)
# print(list_sum)

def ans():
    global list_sum, cnt
    while list_sum % 2 == 0:
        
        list_sum /= 2
        cnt += 1

# 2つ奇数がある場合を考える
for i in range(n):
    if a[i] % 2 != 0:
        cnt = 0
        break
    else:
        ans()

print(cnt)

Submission status: Wrong Answer

Solution code:
n = int(input())
a = list(map(int, input().split()))
cnt = 0

list_sum = sum(a)
# print(list_sum)

def ans():
    global list_sum, cnt
    while list_sum % 2 == 0:
        
        list_sum /= 2
        cnt += 1

# 2つ奇数がある場合を考える
for i in range(n):
    if a[i] % 2 != 0:
        cnt = 0
    else:
        ans()

print(cnt)

Submission status: Wrong Answer

Solution code:

a = list(map(int, input().split()))
i = 0
odd = 0
while odd == 0:
    for n in range(len(a)):
        if a[n]%2 == 0:
            a[n] /= 2
        else:
            odd = 1
            break
    if odd == 0:
        i += 1
print(i)

Submission status: Wrong Answer

Solution code:
import numpy as np
a = np.array([int(x) for x in input().split()])
count = 0
x = 0
 
while x == 0:
    if np.all(a%2 ==0):
        count+=1
        a = a/2
    else:
        break
 
 
print(count)

Submission status: Wrong Answer

Solution code:
num = input()
l = input().split()
count = 0
for k in l:
    x = int(k) % 2
    if x == 0:
        for i in l:
            y = int(i) % 2 
            if y == 0:
                count += 1
print(int((count - 3 )/ 3))