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:
#ABC081

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

s = sum(a)
s // (2 ** n)
c = True
count = 0
while c:
    
    a = [a[i] // 2 for i in range(len(a))]
    count += 1
    for i in range(n):
        if a[i] % 2 != 0:
            c = False
print(count)

Submission status: Wrong Answer

Solution code:
N = int(input())
b = list(map(int, input().split()))
cnt = 0
for i in b:
    i % 2 ==0
    b = [i/2 for i in b]
    cnt += 1
    if i % 2 != 0:
        break
print(cnt-1)

Submission status: Wrong Answer

Solution code:
N = int(input())
b = (int(s) for s in input().split())
x = 0
for i in b:
    i = i // 2
    c = i % 2
    x = x + 1
    if c != 0:
        break
print(x)

Submission status: Wrong Answer

Solution code:
n = int(input())
lst = list(map(int, input().split()))
cnt = 0
while sum(lst) % 2 == 0:
    cnt += 1
    lst = list(map(lambda x: x / 2, lst))

print(cnt)

Submission status: Wrong Answer

Solution code:
n=int(input())
s=[int(x) for x in input().split()]
w=10000009
for x in s:
    w=min(w,x&-x)
tot=0
while w>1:
    w=w/2
    tot=tot+1
print(tot)

Submission status: Wrong Answer

Solution code:
a = int(input())
lis = list(map(int, input().split()))
for i in range(a):
  if lis[i]%2 == 0:
    lis[i] = lis[i]/2
  else:
    break
print(i)

Submission status: Wrong Answer

Solution code:
n = int(input())
a = [int(x) for x in input().split()]
d=0
while True:
    c=0
    for i in range(n):
        if a[i]%2==0:
            a[i]=a[i]/2
            c+=1
    if c==0:
        break
    else:
        d+=1
print(d)

Submission status: Wrong Answer

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

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:
n = int(input())
s = list(map(int,input().split()))
count = 0
error = 0
while(error == 0):
    for i in range(len(s)):
        if(s[i]%2 != 0):
            error = 1
            break
    count = count + 1
print(count)

Submission status: Wrong Answer

Solution code:
input()
num_list = list(map(int, input().split()))
min_cnt = 0
for num in num_list:
  num_cnt = 0
  while True:
    if num % 2 == 1:
      if num_cnt < min_cnt: min_cnt = num_cnt
      break
    else:
      num = num / 2
      num_cnt += 1
print(min_cnt)

Submission status: Wrong Answer

Solution code:
input()
num_list = list(map(int, input().split()))
min_cnt = 0
for num in num_list:
  num_cnt = 0
  while True:
    if num % 2 == 1:
      if num_cnt < min_cnt: min_cnt = num_cnt
      break
    else:
      num = num / 2
      min_cnt += 1
print(min_cnt)

Submission status: Wrong Answer

Solution code:
input()
num_list = list(map(int, input().split()))
max_cnt = 0
for num in num_list:
  num_cnt = 0
  while True:
    if num % 2 == 1:
      if num_cnt > max_cnt: max_cnt = num_cnt
      break
    else:
      num = num / 2
      num_cnt += 1
print(max_cnt)

Submission status: Wrong Answer

Solution code:
def main():
    N = int(input())
    num = list(map(int, input().split()))
    counter = [0] * N
    for j in range(N):
        while num[j]%2==0:
            num[j] = num[j]/2
            counter[j] += 1
    print(min(counter))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
n = int(input())
a = [int(x) for x in input().split()]
ans = 0
 
for i in a:
  if i%2 == 1:
    break
    
  else:
    ans += 1
    
print(ans-1)

Submission status: Wrong Answer

Solution code:
n = int(input())
a = [int(x) for x in input().split()]
ans = 0

for i in a:
  if not i%2:
    break
    
  else:
    ans += 1
    
print(ans)

Submission status: Wrong Answer

Solution code:
numList = list(map(int, input().split(" ")))
div2 = 29

for item in numList:
    if item < int(pow(2, div2)):
        for itr_cmpr in range(div2):
            if item > int(pow(2, div2 - (1 + itr_cmpr))):
                div2 = div2 - (1 + itr_cmpr)
                break
    
    if (item % int(pow(2, div2)) != 0):
        for itr_div in range(div2):
            if item % int(pow(2, (div2 - (1 + itr_div)))) == 0:
                div2 = div2 - (1 + itr_div)
                break

print(div2)

Submission status: Wrong Answer

Solution code:
numList = list(map(int, input().split(" ")))
div2 = 29

for item in numList:
    print(div2)
    if item < int(pow(2, div2)):
        for itr_cmpr in range(div2):
            if item > int(pow(2, div2 - (1 + itr_cmpr))):
                div2 = div2 - (1 + itr_cmpr)
                break
    
    print(div2)

    if (item % int(pow(2, div2)) != 0):
        for itr_div in range(div2):
            if item % int(pow(2, (div2 - (1 + itr_div)))) == 0:
                div2 = div2 - (1 + itr_div)
                break

print(div2)

Submission status: Wrong Answer

Solution code:
numList = list(map(int, input().split(" ")))
div2 = 29

for item in numList:
  if item < int(pow(2, div2)):
    for itr_cmpr in range(div2):
      if item > int(pow(2, div2 - (1 + itr_cmpr))):
        div2 = div2 - (1 + itr_cmpr)
        break
  
  if (item % int(pow(2, div2)) != 0):
    for itr_div in range(div2):
      if item % int(pow(2, (div2 - (1 + itr_div)))) == 0:
        div2 = div2 - (1 + itr_div)
        break

print(div2)

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
N = int(input())
A = list(map(int, input().split()))
B = []
for a in A:
  i = 0
  while a % 2 ** i == 0:
    i += 1
    B.append(i - 1)
B.sort()
print(B[0])

Submission status: Wrong Answer

Solution code:
N = int(input())
A = list(map(int, input().split()))
B = []
flg = True
for a in A:
  i = 0
  while flg:
    if a % 2 ** i == 0:
      i += 1
    else:
      B.append(i - 1)
      flg = False
B.sort()
print(B[0])

Submission status: Wrong Answer

Solution code:
N = int(input())
A = list(map(int, input().split()))
B = []
flg = True
for a in A:
  i = 0
  while flg:
    if a % 2 ** i == 0:
      i += 1
    else:
      B.append(i)
      flg = False
B.sort()
print(B[0])

Submission status: Wrong Answer

Solution code:
N = int(input())
A = list(map(int, input().split()))
B = []
for a in A:
  i = 0
  while True:
    if a % 2 ** i == 0:
      i += 1
    else:
      B.append(i)
      break
B.sort()
print(B[0])

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
#https://atcoder.jp/contests/abc154/tasks/abc154_c
# -*- coding: utf-8 -*-
N = int(input())
A = [int(i) for i in input().split()]
ans =0
while sum(A) % 2 == 0:
  for i in range(N):
    A[i] = A[i]/2
  ans = ans+1
print(ans)

Submission status: Wrong Answer

Solution code:
n = int(input())
array = list(map(int, input().split()))
print(array)
def shift_only(array):
    tmp = []
    counter = 0
    while True:
        flag = True
        # 全て偶数かを確認
        for num in array:
            if num%2 != 0:
                flag = False
        if flag == False:
            break
        array = [i/2 for i in array]
        counter +=1
    print(counter)
shift_only(array)

Submission status: Wrong Answer

Solution code:
def shift_only(array):
    tmp = []
    counter = 0
    while True:
        flag = True
        # 全て偶数かを確認
        for num in array:
            if num%2 != 0:
                flag = False
        if flag == False:
            break
        array = [i/2 for i in array]
        counter +=1
    print(counter)
n = int(input())
array = [i for i in range(n)]

Submission status: Wrong Answer

Solution code:
def shift_only(N,array):
    tmp = []
    counter = 0
    while True:
        flag = True
        # 全て偶数かを確認
        for num in array:
            if num%2 != 0:
                flag = False
        if flag == False:
            break
        array = [i/2 for i in array]
        counter +=1
    return counter

Submission status: Wrong Answer

Solution code:
def shift_only(n,array):
    tmp = []
    counter = 0
    while True:
        flag = True
        # 全て偶数かを確認
        for num in array:
            if num%2 != 0:
                flag = False
        if flag == False:
            break
        array = [i/2 for i in array]
        counter +=1
    return counter

Submission status: Wrong Answer

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

count = 0
s = sum(a)
while(s % 2== 0 and s != 0):
  count+=1
  s = s//2
print(count)

Submission status: Wrong Answer

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

count = 0
s = sum(a)
while(s % 2== 0):
  count+=1
  s = s//2
print(count)

Submission status: Wrong Answer

Solution code:
n=int(input())
l=list(map(int,input().split()))
ans=0
for i in l:
  t=0
  while(i%2==0):
    i=i//2
    t+=1
  ans=min(ans,t)
print(ans)

Submission status: Wrong Answer

Solution code:
n=int(input())
a=list(map(int,input().split()))
s=[]
i=0
cnt=0
while a[i]%2==0:
    cnt+=1
    a[i]=a[i]//2
else:
    i+=1
s.append(cnt)
print(min(s))

Submission status: Wrong Answer

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

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 = input().split()
A = [int(i) for i in A]

check1 = 0
count1 = 0
while check1 == 0:
    print("this is")
    for i in range(len(A)):
        if(A[i]%2 == 0):
            A[i] = A[i]/2
        else:
            check1 = 1
            break
    count1 += 1
        
count1 -= 1
print(count1)

Submission status: Wrong Answer

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

check1 = 0
count1 = 0
while check1 == 0:
    print("this is")
    for i in range(len(A)):
        if(A[i]%2 == 0):
            A[i] = A[i]/2
        else:
            check1 = 1
            break
    count1 += 1
        
count1 -= 1
print(count1)

Submission status: Wrong Answer

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

check1 = 0
count1 = 0
while check1 == 0:
    print("this is")
    for i in range(len(A)):
        if(A[i]%2 == 0):
            A[i] = A[i]/2
        else:
            check1 = 1
            break
    count1 += 1
        
count1 -= 1

Submission status: Wrong Answer

Solution code:
n = int(input())
list = list(map(int, input().split()))
b = 0
cont = True

while cont:
  for i in range(n):
    if(list[i] % 2 == 0):
      list[i] = list[i] / 2
    else:
      cont = False
  b += 1
     
print(b)

Submission status: Wrong Answer

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

for i in range(100):
    c = [i for i in a if i % 2 == 0]
    if(len(c) != n):
        break
print(i)

Submission status: Wrong Answer

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

for i in range(n):
    for j in range(len(a)):
        if(a[j] % 2 == 0):
            a[j] = a[j] //2
        else:
            quit()  
    cnt += 1
print(cnt)

Submission status: Wrong Answer

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

# n = 5
# A = [2,4, 6]

cnt = 0

flag=True
while flag:
    for a in A:
        if a % 2 == 0:
            continue
        else:
            flag=False
            break 
    A = [a/2 for a in A]
    cnt = cnt + 1
print(cnt)

Submission status: Wrong Answer

Solution code:
n = int(input())
a = list(map(int,input().split()))
cnt=0
while True:
    if sum(a) % 2 != 0:
        break
    else:
        a = list(map(lambda x: x/2, a))
        cnt = cnt + 1
print(cnt)

Submission status: Wrong Answer

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

c = 0
for arg in args:
    cc =int(arg / 2)
    if cc > c:
        c = cc
print(c)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
"""
author : halo2halo
date : 29, Jan, 2020
"""

import sys

# import itertools
# import numpy as np

read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
sys.setrecursionlimit(10 ** 7)


def num(n):
    cnt = 0
    while n:
        if n % 2 == 0:
            cnt += 1
            n /= 2
        else:
            break
    return cnt


N, *A = map(int, read().decode('utf8').split())

ans = 0
for i in A:
    ans += num(i)
print(ans)

Submission status: Wrong Answer

Solution code:
N=int(input())
li= list(map(int,input().split())) 	
Ans=27
ans=0

for i in range(N):
	if li[i]%2==1:
		Ans=0
		break
	else:
		n=li[i]
		ans=0
		while n%2==0:
			n=n/2
			ans= ans+1
		if Ans>ans:
			Ans =ans

print(Ans)

Submission status: Wrong Answer

Solution code:
N=int(input())
li= list(map(int,input().split())) 	
Ans=27
ans=0

for i in range(N):
	if li[i]%2==1:
		Ans=0
		break
	else:
		n=li[i]
		ans=0
		while n%2==0:
			n=n/2
			ans= ans+1
		if ans < Ans:
			Ans =ans

print(Ans)

Submission status: Wrong Answer

Solution code:
N=int(input())
li= list(map(int,input().split())) 	
ans=1
minNum=10**9

for i in range(N):
	if li[i]%2==1:
		ans=0
		break
	elif li[i] < minNum:
		minNum = li[i]
		
if not ans==0:
	n=minNum
	ans=0	
	while n%2==0:
		n=n/2
		ans= ans+1

print(ans)

Submission status: Wrong Answer

Solution code:
N=int(input())
li= list(map(int,input().split())) 	
ans=1
minNum=li[0]

for i in range(N):
	if li[i]%2==1:
		ans=0
		break
	elif li[i] < minNum:
		minNum = li[i]
		
if not ans==0:
	n=minNum
	ans=0	
	while n%2==0:
		n=n/2
		ans= ans+1

print(ans)

Submission status: Wrong Answer

Solution code:
import numpy as np

N = int(input())
A = np.array(list(map(int, input().split())))

cnt = 0

for j in range(2**27):
    for i in range(N):
        if A[i]%2 != 0:
            print(cnt)
            exit()
        A = A/2
        cnt += 1

Submission status: Wrong Answer

Solution code:
def calc(c, cnt):
    if sum(c) % 2 == 1:
        print(cnt)
        return 1
    else:
        for k, num in enumerate(c):
            c[k] = num / 2
        cnt += 1
        if calc(c, cnt) == 1:
            return 1
        

N = int(input())
c = [int(i) for i in input().rstrip().split(' ')]
calc(c, 0)

Submission status: Wrong Answer

Solution code:
n = int(input())
lis = list(map(int, input().split()))
odd_flag = 0
count = 0

while odd_flag == 0:
    for i in range(0, n):
        if lis[i] % 2 == 0:
            lis[i] = lis[i]/2
            count += 1/n
        else:
            odd_flag = 1
            

ans=round(count, 100)
ans=int(ans)
print(ans)

Submission status: Wrong Answer

Solution code:
n = int(input())
lis = list(map(int, input().split()))
odd_flag = 0
count = 0

while odd_flag == 0:
    for i in range(0, n):
        if lis[i] % 2 == 0:
            lis[i] = lis[i]/2
            count += 1/n
        else:
            odd_flag = 1

ans = int(count)


print(ans)

Submission status: Wrong Answer

Solution code:
n = int(input())
a = list(map(int, input().split()))
mod = [0]*n
check = 0
    
for ii in range(1000):
    for i in range(n):
        mod[i] = a[i] % 2
        check = check + mod[i]
        a[i] = a[i]/2
    if (check==1):
        print(ii)
        break

Submission status: Wrong Answer

Solution code:
import sys
n=int(input())
a=list(map(int,input().split()))
ans=0
a.sort()
for i in a:
    if i %2 !=0:
        print(ans)
        sys.exit()
j=a[0]        
while j > 1:
    print(j)
    ans+=1
    j=j//2
    
print(ans-1)

Submission status: Wrong Answer

Solution code:
N=input()
ls=list(map(int,input().split()))
ans=0
flag=0
while flag==1:
  for elem in range(N):
    if ls[elem]%2:
      ls[elem]=ls[elem]/2
    else:
      flag=1
  ans+=1
print(ans)

Submission status: Wrong Answer

Solution code:
N=input()
ls=list(map(int,input().split()))
ans=0
flag=0
while flag==1:
  for elem in range(N):
    if ls[elem]%2:
      ls[elem]=ls[elem]%2
    else:
      flag=1
  ans+=1
print(ans)

Submission status: Wrong Answer

Solution code:
N=input()
ls=list(map(int,input().split()))
ans=0
flag=0
while flag==1:
  for elem in ls:
    if ls[elem]%2:
      ls[elem]=ls[elem]%2
    else:
      flag=1
  ans+=1
print(ans)

Submission status: Wrong Answer

Solution code:
N=input()
ls=list(map(int,input().split()))
ans=0
flag=0
while flag==1:
  for elem in ls:
    if ls[elem]%2:
      ls[elem]=ls[elem]%2
    else:
      flag=1
    ans+=1
print(ans)

Submission status: Wrong Answer

Solution code:
lis = list(map(int, input().split()))
 
count = 0
flag = 0
while(1):
  for v in lis:
    if v % 2 == 1:
      print(count)
      flag = 1
      break
    v = v / 2
  if flag==1:
    break

Submission status: Wrong Answer

Solution code:
n = int(input())
ais = input().split()
t = []
for a in ais:
  m = 0
  a = int(a)
  while a % 2 == 0:
    m += 1
    a = a / 2
  t.append(m)
print(t)
print(min(t))

Submission status: Wrong Answer

Solution code:
def calc_half(n):
    return n / 2

def calc_rem(n):
    return n % 2

N = input()

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

n = 0
while list(map(calc_rem, A)) == [0, 0, 0]:
    A = map(calc_half, A)
    n += 1
print(n)

Submission status: Wrong Answer

Solution code:
import numpy as np
flg = 1
N = input()
arr = np.array([0 for i in range(int(N))])
cnt = 0
s = input()
s = s.split()
for i in range(int(N)):
  arr[i]=int(s[i])
while flg == 1:
  for i in range(int(N)):
    arr[i]=arr[i]/2
    if(arr[i]%2==1):
      flg = 0
  cnt = cnt + 1
print(cnt)

Submission status: Wrong Answer

Solution code:
num_length = input()
A_list = [int(x) for x in input().split()]

Submission status: Wrong Answer

Solution code:

n=input()
ans=0
i=0
b=list(map(int,input().split()))
print(b)
print(type(b[0]))
end=True
while end:
    for x in b:
        if x%2!=0:
            print(ans)
            end=False
            break
    b=list(map(lambda x:x/2,b))
    print(b)
    ans+=1

Submission status: Wrong Answer

Solution code:

n=input()
ans=0
i=0
b=list(map(int,input().split()))
print(b)
print(type(b[0]))
end=True
while end:
    b=list(map(lambda x:x/2,b))
    print(b)
    ans+=1
    for x in b:
        if x%2!=0:
            print(ans)
            end=False
            break

Submission status: Wrong Answer

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

count = [0]*n

for i in range(n):
    a = al[i]
    for _ in range(1, 9):
        if a%2 == 0:
            a = a/2
            count[i] += 1
        else:
            break

print(min(count))

Submission status: Wrong Answer

Solution code:
N = int(input())
A = list(input().split())
print(list(map(lambda x: int(x) % 2 == 0, A)).count(True))

Submission status: Wrong Answer

Solution code:
import math
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)
  print(round(ans))

Submission status: Wrong Answer

Solution code:
n=int(input())
l=[int(n) for n in input().split()]
sum=0
oc=1
for i in l:
    if i%2!=0:
        oc=0
    sum+=i
if(oc==0):
    print(0)
else:
    c=0
    while(sum%2==0 and sum>=2):
        c+=1
        sum=sum//2
    print(c)

Submission status: Wrong Answer

Solution code:
from sys import exit

n=int(input())
l=[int(n) for n in input().split()]
sum=0
for i in l:
    if i%2!=0:
        print(0)
        exit(0)
    sum+=i
c=0
while(sum%2==0 and sum>=2):
    c+=1
    sum=sum//2
print(c)

Submission status: Wrong Answer

Solution code:
from sys import exit
print(0.5%45)
n=int(input())
l=[int(n) for n in input().split()]
sum=0
for i in l:
    if i%2!=0:
        print(0)
        exit(0)
    sum+=i
c=0
while(sum%2==0 and sum>=2):
    c+=1
    sum=sum//2
print(c)

Submission status: Wrong Answer

Solution code:
N = int(input())
A = input().split()
count = 0
count_min = 0
for i in range(N):
    count = 0
    Ai = int(A[i])
    while Ai % 2 == 0:
        count += 1
        Ai = Ai / 2
    if count_min == 0:
        count_min = count
    elif count_min > count:
        count_min = count

print(count_min)

Submission status: Wrong Answer

Solution code:
time = int(input())
num = input().split()
count = 0
flg = True

while flg == True:
#	print('a')
	for i in range(time):
		if int(num[i]) % 2 == 1:
#			print('b')
			flg = False
			break
		num[i] = int(num[i]) / 2
		count += 1
#	print(num)
print(count)

Submission status: Wrong Answer

Solution code:
n=int(input())

a=input()

def c(x):
    return (x.count('1')),(x.count('2')),(x.count('3')),(x.count('4'))

print(max(c(a)))
print(min(c(a)))

Submission status: Wrong Answer

Solution code:
time = int(input())
num = input().split()
count = 0
flg = True

while flg == True:
#	print('a')
	for i in range(time):
		num[i] = int(num[i]) / 2
		if int(num[i]) % 2 != 0:
			flg = False
	count += 1
#	print(num)
print(count)

Submission status: Wrong Answer

Solution code:
time = int(input())
num = input().split()
count = 0
flg = True

while flg == True:
#	print('a')
	for i in range(time):
		num[i] = int(num[i]) / 2
		if int(num[i]) % 2 != 0:
			flg = False
			break
	count += 1
#	print(num)
print(count)

Submission status: Wrong Answer

Solution code:
time = int(input())
num = input().split()
count = 0
flg = True

while flg == True:
#	print('a')
	for i in range(time):
		num[i] = int(num[i]) / 2
		if int(num[i]) % 2 != 0:
			flg = False
			break
		count += 1
#	print(num)
print(count)

Submission status: Wrong Answer

Solution code:
time = int(input())
num = input().split()
count = 0
flg = True

while flg == True:
	for i in range(time):
		num[i] = int(num[i]) / 2
		if int(num[i]) % 2 != 0:
			flg = False
			break
	count += 1
print(count)

Submission status: Wrong Answer

Solution code:
n = int(input())
A = list(map(int, input().split()))
cont = 0
cont_list =[0]

for a in A:
    if a % 2 != 0:
        break
    else:
        while a % 2==0:
            a //= 2
            cont += 1
        cont_list.append(cont)
        cont=0

print(min(cont_list))

Submission status: Wrong Answer

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

cnt = 0

flag = True

while flag == True:
    for i in range(n):
        if a[i]%2:
            flag = False
            cnt -= 1
        a[i] = a[i]//2
    cnt += 1
print(cnt)

Submission status: Wrong Answer

Solution code:
import math

N = input()
if N == '0':
  print(0)

As = [int(a) for a in input().split()]
Fs = [math.floor(math.log2(a)) if a % 2 == 0 else 0 for a in As]

print(int(min(Fs)))

Submission status: Wrong Answer

Solution code:
import math

N = input()
if N == '0':
  print(0)

As = map(int, input().split())
Fs = map(lambda a: math.log2(a) if a % 2 == 0 else 0, As)

print(int(min(Fs)))

Submission status: Wrong Answer

Solution code:
import math

N = input()
As = map(int, input().split())
Fs = map(lambda a: math.log2(a) if a % 2 == 0 else 0, As)

print(int(min(Fs)))

Submission status: Wrong Answer

Solution code:
import math

N = input()
As = map(lambda a: math.log2(int(a)), input().split())

print(int(min(As)))

Submission status: Wrong Answer

Solution code:
K = int(input())
A = list(map(int, input().split()))
L = []
def sec(N):
  count = 0
  while True:
    if not N%2 ==0:
      L.append(count)
      exit()
    N = N/2
    count +=1
    
for i in range(K):
  sec(A[i])
print(min(L))

Submission status: Wrong Answer

Solution code:
A = list(map(int, input().split()))
C=0
for i in A:
  C+=1
  map(lambda x:x/2,A)
  
  if type(i) != 'int':
    print(C)
    break
  elif i == 0:
    print(C-1)
    exit()

Submission status: Wrong Answer

Solution code:
def f(n):
  return n%2

n=int(input())
L = list(map(int, input().split()))
x=0 if f(L[0])==1 or f(L[1])==1 or f(L[2])==1 else format(min(L), 'b')[::-1].find('1')-1;print(x)

Submission status: Wrong Answer

Solution code:
N = int(input())
A = input().split()
x = 0
def even(x):
  for i in A:
    if A[i]%2 != 0:
      break
    else:
      x+=1
  return x

if x == N:
  print(min(A)/2 -1)
else:
  print(x)

Submission status: Wrong Answer

Solution code:
print(input().count("1"))

Submission status: Wrong Answer

Solution code:
t=int(input())

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

count=0
while True:
    x=[True if i%2==0 else False for i in li]
    print(x)
    if all(x):
        for i in range(t):
            li[i]=li[i]/2
        count+=1
    else:
        break
print(count)

Submission status: Wrong Answer

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

while flag:
    ans = []
    for i in a:
        if i%2 == 1:
            flag = False
        else:
            ans.append(i/2)
    if len(ans) == n:
        cnt += 1
        a = ans

Submission status: Wrong Answer

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

while flag == 1:
    b = list(map(lambda x: x % 2, a))
    if b.count(1) == 0:
        a = list(map(lambda x: x / 2, a))
        count += 1
    else:
        flag = 0

print(count)

Submission status: Wrong Answer

Solution code:
evens = [6,4,10,4]
itr = 0
flg = True
while flg:
  evens = list(map(lambda x: (x/2), evens))
  is_evens = list(map(lambda x: x.is_integer(), evens))
  if not all(is_evens):
    flg = False
    break
  itr+=1
print(itr)

Submission status: Wrong Answer

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

while(True):
  for i in li:
    if i % 2 == 1:
      break
  else:
    count += 1
    for index, x in enumerate(li):
      li[index] = x / 2
    continue
  break

print(count)

Submission status: Wrong Answer

Solution code:
s = input()
num_list = list(map(int, input().split()))

flg_break = True

while flg_break:
    count = 0
    num_tmp_list = []
    for n in num_list:
        if n % 2 != 0:
            flg_break = False
            break
        else:
            num_tmp = n / 2
            num_tmp_list.append(num_tmp)
    num_list = num_tmp_list
    count+=1

print(count)

Submission status: Wrong Answer

Solution code:
s = input()
num_list = list(map(int, input().split()))
flg_break = True

while flg_break:
    count = 0
    num_tmp_list = []
    for n in num_list:
        print(n)
        if n % 2 != 0:
            flg_break = False
            break
        else:
            num_tmp = n / 2
            num_tmp_list.append(num_tmp)
    num_list = num_tmp_list
    count+=1

print(count)

Submission status: Wrong Answer

Solution code:
N = input()
A_sum = sum(map(int, input().split()))
cnt = 0

while 1:
    if A_sum % 2 == 1:
        break
    A_sum /= 2
    cnt += 1
print(cnt)

Submission status: Wrong Answer

Solution code:
N = int(input())
A = [int(i) for i in input().split()]
for i in range(N):
    while True:
        A[i] = A[i]/2
        if A[i]%2==1:
            break

print(min(A))

Submission status: Wrong Answer

Solution code:
n=input()
mx=0
for a in map(int,input().split()):
    i=0
    if a%2!=0: break
    while a%2==0:
        i+=1
        mx=i
        a/=2
    if mx<i:
        mx=i

print(mx)

Submission status: Wrong Answer

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

print(mx)

Submission status: Wrong Answer

Solution code:
N = int(input())
a_list = list(map(int,input().split()))
counter = 1
while True:
    i = 0
    for w in a_list:
        a_list[i] = w / 2
        if a_list[i] % 2 == 1:
            break
        else :
            i += 1
    
    if len(a_list) != i:
        break
    counter += 1
print(counter)

Submission status: Wrong Answer

Solution code:
N = int(input())
a_list = list(map(int,input().split()))
counter = 1
while True:
    i = 0
    for w in a_list:
        a_list[i] = w / 2
        if a_list[i] % 2 == 1:
            break
        else :
            i += 1
    
    if len(a_list) != i:
        break
    print(a_list)
    counter += 1
    print(counter)
print(counter)

Submission status: Wrong Answer

Solution code:
N = int(input())

a_list = []
a_list = list(map(int,input().split()))
counter = 0
while True:
    i = 0
    for w in a_list:

        a_list[i] = w / 2
        if a_list[i] % 2 == 1:
            break
        else :
            i += 1
    
    if len(a_list) != i + 1:
        break
    counter += 1
print(counter)

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
N = int(input())
A = list(map(int,input().split()))
for i in A:
    p = 0
    while i % 2 == 0:
        i //= 2
        p += 1
print(p)

Submission status: Wrong Answer

Solution code:

N = int(input())

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

cnt = 0
flag = True

while flag:
    for i in range(N):
        if num_list[i] % 2 == 1:
            flag = False
            break
        else:
            num_list[i] = num_list[i] / 2
            
    cnt += 1

print(cnt)

Submission status: Wrong Answer

Solution code:
num_li = list(map(int, input().split()))
count = 0
loop = True
while True:
    for i in range(len(num_li)):
        if num_li[i]%2 == 1:
            loop = False
            break
        else:
            num_li[i] /= 2
    if loop == False:
        break
    else:
        count += 1
print(count)