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:
num_li = list(map(int, input().split()))
count = 0
loop = True
while True:
    for i in num_li:
        if i%2 == 1:
            loop = False
            break
    if loop == False:
        break
    else:
        count += 1
print(count)

Submission status: Wrong Answer

Solution code:
n = int(input())

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

count = 0
while True:
  s = sum(a)
  if s % 2 == 0:
    a = list(map(lambda i: int(i/2), a))
    count += 1
  else:
    break

print(count)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

from functools import reduce
print(3)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

ans = 0

min_a = min(a)

while True:
  if min_a % 2 ==0:
    min_a = min_a / 2
    ans += 1
  else:
    break

print(ans)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
n=int(input())
a=list(map(int,input().split()))
ans=0
for i in range(100):
  for j in range(n):
    if a[j] // 2 ==0:
      a[j]=a[j]//2
      if j==n-1:
        ans+=1
    else:
      break
  else:
    continue
  break
print(ans)

Submission status: Wrong Answer

Solution code:
n=int(input())
a=list(map(int,input().split()))
ans=0
for i in range(100):
  for j in range(n):
    if a[j] // 2 ==0:
      a[j]=a[j]//2
      if j==n:
        ans+=1
    else:
      break
  else:
    continue
  break
print(ans)

Submission status: Wrong Answer

Solution code:
n=int(input())
a=list(map(int,input().split()))
ans=0
for i in range(100):
  for j in range(n):
    if a[j] // 2 ==0:
      a[j]=a[j]//2
    if j==n:
      ans+=1
    else:
      break
  else:
    continue
  break
print(ans)

Submission status: Wrong Answer

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

def check_all_even(A):
    # check if all numbers in A are even number
    for a in A:
        if a % 2 == 0:
            if a == A[-1]:
                return True
        else:
            return False

# print(check_all_even(A))

count = 0
while True:
    if check_all_even(A):
        count+=1
        A = list(map(lambda a: a / 2, A))
        # print(A)
    else:
        break

print(count)

Submission status: Wrong Answer

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

def check_all_even(A):
    # check if all numbers in A are even number
    for a in A:
        if a == 0:
            break
        if a % 2 == 0:
            if a == A[-1]:
                return True
        else:
            return False

# print(check_all_even(A))

count = 0
while True:
    if check_all_even(A):
        count+=1
        A = list(map(lambda a: int(a / 2), A))
        # print(A)
    else:
        break

print(count)

Submission status: Wrong Answer

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

def check_all_even(A):
    # check if all numbers in A are even number
    for a in A:
        if a % 2 == 0:
            if a == A[-1]:
                return True
        else:
            return False

# print(check_all_even(A))

count = 0
while True:
    if check_all_even(A):
        count+=1
        A = list(map(lambda a: int(a / 2), A))
        # print(A)
    else:
        break

print(count)

Submission status: Wrong Answer

Solution code:
l = list()
original_list = list()
n = int(input())
original_list = list(range(1,n))
for x in original_list:
      ans = 0
      while x % 2 == 0:
        x = x / 2
        ans = ans + 1
      l.append(ans)
 
print(max(l))

Submission status: Wrong Answer

Solution code:
l = list()
n = int(input())
original_list = list(range(1,n))
for x in original_list:
      ans = 0
      while x % 2 == 0:
        x = x / 2
        ans = ans + 1
      l.append(ans)
 
print(max(l))

Submission status: Wrong Answer

Solution code:
n=int(input())
l=list(map(int,input().split()))
ans=0
c=True

while c == True:
    for i in range(n):
        if l[i]%2==1:
            c = False
            break
    for i in range(n):
        l[i]/=2
    ans+=1
print(ans)

Submission status: Wrong Answer

Solution code:
num = int(input())
x = input().split()
count = 0
TF = True
while TF: 
    
    for i in range(0,num):
        number = int(x[i])
        if(number%2==0):
            x[i] = number/2
            TF = True
        else:
            TF =False
    if TF:
        count += 1
print(count)

Submission status: Wrong Answer

Solution code:
num = int(input())
x = input().split()
count = 0
TF = True
while TF: 
    
    for i in range(0,num):
        number = int(x[i])
        if(number%2==0):
            number = number/2
            x[i] =  number
            TF = True
        else:
            TF =False
    if TF:
        count += 1
print(count)

Submission status: Wrong Answer

Solution code:
num = int(input())
x = input().split()
count = 0
TF = True
while TF: 
    count += 1
    for i in range(0,num):
        number = int(x[i])
        if(number%2==0):
            number = number/2
            x[i] =  number
            TF = True
        else:
            TF =False
print(count)

Submission status: Wrong Answer

Solution code:
num = int(input())
x = input().split()
count = 0
TF = True
while TF: 
    count += 1
    for i in range(0,num):
        number = int(x[i])
        if(number%2==0):
            number = number/2
            x[i] =  number
            TF = True
        else:
            TF =False
print(count)
print(x)

Submission status: Wrong Answer

Solution code:
for_num = int(input())
nums = input()
nums = nums.split()

count = 0
Tf = True
while Tf:
    count += 1
    for i in range(0,for_num):
        num = int(nums[i])
        if num%2 == 0:
            nums[i] = int(num/2)
            Tf = True
        else:
            Tf = False
print(count-1)

Submission status: Wrong Answer

Solution code:
# -*- coding: utf-8 -*-

import numpy
import scipy

N = int(input())
A = list(map(int, input().split()))
#print(A)

c = 0
flg = False
while True:
    print(A)
    for i, a in enumerate(A):
        if a%2 == 0:
            A[i] /= 2
            #pass
        else:
            flg = True
            break
    if flg:
        break
    c += 1
print(c)

Submission status: Wrong Answer

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

print(ans)

Submission status: Wrong Answer

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

c = 0
while 1:
  c += 1
  if any(i%2 for i in a):
    print(c)
    exit()

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import numpy as np
arr =  np.array([int(i) for i in input().split()])

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

print(count)

Submission status: Wrong Answer

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

count = 0
while(True):
    for i in range(N):
        if arr[i] % 2 == 0:
            arr[i] = arr[i] / 2
            if i == 2:
                count += 1
        else:
            break
    else:
        continue
    break

Submission status: Wrong Answer

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

count = 0
while(True):
    for i in range(N):
        if arr[i] % 2 == 0:
            arr[i] = arr[i] / 2
            if i == 2:
                count += 1
        else:
            break
    else:
        continue
    break
        
        

print(count)

Submission status: Wrong Answer

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

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

print(count)

Submission status: Wrong Answer

Solution code:
N = int(input())
x = list(map(int, input().split()))
flag = True
count = 0
print(x)

while flag:
    print(8)
    for i in range(N):
        if x[i] % 2 == 0:
            x[i] = x[i] / 2
        else:
            flag = False
            break
    else:
        count += 1

print(count)

Submission status: Wrong Answer

Solution code:
N=int(input())
A=list(map(int,input().split()))
flg=1
count=0
while(flg==1):
    for i in A:
        if i%2!=0:
            flg=0
    if flg==1:
        for i in A:
            i=i%2
        count+=1

Submission status: Wrong Answer

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

max_2 = 0

for num in li:
  two = 0
  if num % 2 == 0:
    num /= 2
    two += 1
  else:
    if two > max_2:
      max_2 = two

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
N = int(input())

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

for i in A:
  if i%2 != 0:
    print(0)
    exit()
    
cnt = 0
m = min(A)
for j in range(10**9):
  m = m // 2
  cnt += 1
  if m%2 != 0 or m == 2:
    print(cnt)
    exit()
    
print(cnt)

Submission status: Wrong Answer

Solution code:
N = int(input())

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

for i in A:
  if i%2 != 0:
    print(0)
    exit()
    
cnt = 0
m = min(A)
for j in range(10**9):
  if m%2 != 0 or m == 2:
    print(cnt)
    exit()

  else:
    cnt += 1
    m = m // 2
    
print(cnt)

Submission status: Wrong Answer

Solution code:
N = int(input())

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

for i in A:
  if i%2 != 0:
    print(0)
    exit()
    
cnt = 0
m = min(A)
for j in range(10**9):
  if m%2 != 0:
    print(cnt)
    exit()

  else:
    cnt += 1
    m = m // 2
    
print(cnt)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

B=[]
M=0
for k in range(100):
    for i in range(N):
        if A[i]%(2**k)==0:
            M=k
        else:
            break
if M==0:
    print(0)
else:
    print(M-1)

Submission status: Wrong Answer

Solution code:
ans = 10**9
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())
a = list(map(int, input().split()))
c = 0

while sum(a)%2==0:
    a = list(map(lambda x: x/2, a))
    c+=1

print(c)

Submission status: Wrong Answer

Solution code:
a = input()
b = input()
a = int(a)
b = b.split()
b = [int(s) for s in b]
c = 0
flag = True
while True:
    
    for i in range(a):
        if b[i] % 2 != 0:
            flag = False
        b[i] = b[i] / 2
        
    if flag == False:
        break
    c += 1

Submission status: Wrong Answer

Solution code:
a = input()
b = input()
a = int(a)
b = b.split()
b = [int(s) for s in b]
c = 0
flag = True
while True:
    
    for i in range(a):
        b[i] = b[i] / 2
        if b[i] % 2 != 0:
            flag = False
    c += 1
    if flag == False:
        break
    

    
print(c)

Submission status: Wrong Answer

Solution code:
a = input()
b = input()
a = int(a)
b = b.split()
b = [int(s) for s in b]
b.sort()
c = 0
while True:
    if b[0] % 2  != 0:
        break
    for i in range(a):
        b[i] = b[i] / 2
    print(b[0])
    
    c += 1
    
print(c)

Submission status: Wrong Answer

Solution code:
a = input()
b = input()
a = int(a)
b = b.split()
b = [int(s) for s in b]
b.sort()
c = 0
while True:
    for i in range(a):
        b[i] = b[i] / 2
    if b[0] % 2  != 0:
        break
    c += 1
    
print(c)

Submission status: Wrong Answer

Solution code:
n = int(input())
a = list(map(int,input().split()))
a = sorted(a,reverse=1)
a = [int(bin(i)[2:]) for i in a]

b = 0
for i in a:
   b += i

b= str(b)    
b = b[::-1]
cnt=0

for i in b:
    if i == "0":
        cnt +=1
    else:
        break
    
print(cnt)

Submission status: Wrong Answer

Solution code:
n = int(input())
nums = list(map(int, input().split(" ")))
i = 0
res = None
for i in range(n):
	odd = any(num % 2 > 0 for num in nums)
	if odd:
		res = i
		break
	nums = [num//2 for num in nums] 
	i =+ 1
if res is None:
  res = n
print(res)

Submission status: Wrong Answer

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

flg = False
res = 0

while True:
  for i, ai in enumerate(a):
    if ai%2 == 1:
      flg = True
    a[i] //= 2

  res += 1
  if flg:
    break

print(res)

Submission status: Wrong Answer

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

result = 0

while True:
  a = [ai//2 for ai in a]
  result += 1
  if 1 in [ai%2 for ai in a]:
    break

print(result)

Submission status: Wrong Answer

Solution code:
# coding: utf-8


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


for i in range(n):
    hantei = True
    
    for j in range(n):
        if a[j] % 2 ==0:
            a[j] = a[j]/2
        else :
            hantei = False
            break
        
    if hantei:
        count += 1
    else:
        break


print(count)

Submission status: Wrong Answer

Solution code:
N = int(input())
numlist = list(map(int,input().split()))
sum=0
temp = 9999999999999
for i in numlist:
	if i % 2 != 0:
		temp =1
		break
	else:
		while i % 2 ==0:
			i //=2
			sum += 1
		if temp > sum :
			temp = sum
			
print(temp-1)

Submission status: Wrong Answer

Solution code:
N = int(input())
numlist = list(map(int,input().split()))
sum=0
temp = 9999999999999
for i in numlist:
	if i % 2 != 0:
		temp =0
		break
	else:
		while i % 2 ==0:
			i //=2
			sum += 1
		print(sum)
		if temp > sum :
			temp = sum
			
print(temp-1)

Submission status: Wrong Answer

Solution code:
n=int(input())
a=list(map(int,input().split()))
s=[]
def wari(a):
    for i in range(len(a)):
        a[i]=a[i]/2
        #print(a[i]//2%2)
        if a[i]%2==1:
            s.append(1)
c=0
while s==[]:
    #print(s)
    wari(a)
    #print(a)
    c+=1
d=[]
for i in range(n):
    if a[i]%2==1:
        d.append(1)
if d==[]:
    print(c)
else:
    print(c-1)

Submission status: Wrong Answer

Solution code:
n = int(input())
l = [int(_) for _ in input().split()]

for i in l:
    count = 0
    while i % 2 == 0:
        i //= 2
        count += 1
print(count)

Submission status: Wrong Answer

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

for i in A:
    if i % 2 == 1:
        print(ans)
        exit()

sum_a = sum(A)
while sum_a % 2 == 0:
    ans += 1
    sum_a //= 2

print(ans)

Submission status: Wrong Answer

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

sum_a = sum(A)
while sum_a % 2 == 0:
    ans += 1
    sum_a //= 2

print(ans)

Submission status: Wrong Answer

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

while sum(A) % 2 == 0:
    ans += 1
    for i in range(len(A)):
        A[i] //= 2

print(ans)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

a_divided = list(map(how_many_times_divisible,a))

ans = max(a_divided)

print(ans)

Submission status: Wrong Answer

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

count, end =0,0
while end==0:
    A= list(map(lambda x: x/2, A))
    for i in range(N):
        if A[i]% 2 == 1:
            end=1
    count +=1
print(count)

Submission status: Wrong Answer

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

print(b/n)

Submission status: Wrong Answer

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

print(b)

Submission status: Wrong Answer

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

while True:
	for i in range(n):
		if a[i]%2 == 0 :
			a[i] = a[i]/2
			if i == (n-1):
				count += 1
		else:
			break
	break

print(count)

Submission status: Wrong Answer

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

for i in range(n):
	count.append(0)
	while True:
		if a[i]%2 == 0 :
			a[i] = a[i]/2
			count[i] += 1
		else:
			break

print(max(count))

Submission status: Wrong Answer

Solution code:
def resolve():
    # -*- coding: utf-8 -*-
    print(input().count("1"))


resolve()

Submission status: Wrong Answer

Solution code:
a=int(input())
b=list(map(int,input().split()))
c=0
od=0
while True:
    for i in range(a):
        if b[i]%2 == 1:
            od=1
    if od==1:
        break
    for i in range(a):
        b[i]/2
    c+=1

Submission status: Wrong Answer

Solution code:
import sys
input = sys.stdin.readline

n = int(input())
a = list(map(int,input().split()))
b = 0
c = 2
f = 0

r = 0

while True:
    for i in a:
        if i % c > 0:
            f = f +1
            break
    if f == 1:
        break

    b = b + 1
    c = c + 2

print(b)

Submission status: Wrong Answer

Solution code:
import sys
input = sys.stdin.readline

n = int(input())
a = list(map(int,input().split()))
b = 0
c = 2
d = 2



while d < 3:
    for i in a:
        if i % c != 0:
            d = 3
            b = b - 1
    b = b + 1
    c = c + 2

print(b)

Submission status: Wrong Answer

Solution code:
N = int(input())
lst = [int(x) for x in input().split()]
idx = 0
while sum(lst)%2==0:
    lst = [x/2 for x in lst]
    idx += 1
print(idx)

Submission status: Wrong Answer

Solution code:
N = int(input())
lst = map(int, input().split())
idx = 0
while True:
    lst = [x/2 for x in lst]
    if sum(lst)%2:
        break
    else:
        idx += 1
print(idx)

Submission status: Wrong Answer

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

flag=0
count=0
ans=[]
for a in A:
  if a%2==0:
    count=a/2
    ans.append(count)
  else:
    flag=1
if flag==0:
  print(int(min(ans)))
else:
  print(0)

Submission status: Wrong Answer

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

flag=0
count=0
ans=[]
for a in A:
  if a%2==0:
    count=a/2
  else:
    count=(a-1)/2
    flag=1
    ans.append(count)
if flag==1:
  print(int(min(ans)))
else:
  print(0)

Submission status: Wrong Answer

Solution code:
A=list(map(int,input().split()))
flag=0
count=0
ans=[]
for a in A:
  if a%2==0:
    count=a/2
  else:
    count=(a-1)/2
    flag=1
    ans.append(count)
    if flag==1:
      print(int(min(ans)))
    else:
      print(0)

Submission status: Wrong Answer

Solution code:
def calc(l):
    r = 0
    finish = False
    while True:
        for i in range(0, len(l)):
            if l[i] % 2 == 0:
                l[i] = l[i]//2
            else:
                finish = True
                break
        if finish:
            break
        print(l)
        r += 1

    return r


_ = input()
l = list(map(int, input().split()))
r = calc(l)
print(r)

Submission status: Wrong Answer

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

count = 0
flag = 0

while flag == 0 :
	
	for i in range(n):
		flag = 0 if a[i] % 2 == 0 else 1
		a[i] = a[i] / 2


	count += 1 if flag == 0 else +0

print(count)

Submission status: Wrong Answer

Solution code:
N = int(input())
A = list(map(int, input().split()))
t = 0
def exist_odd(A):
  for i in A:
    if i % 2 == 1:
      return 1
      break
    else:
   	  return 0
  
while exist_odd(A) ==0:
  A = list(map(lambda x: x // 2, A))
  t = t+1
print(t)

Submission status: Wrong Answer

Solution code:
N = int(input())
A = list(map(int, input().split()))
t = 0
def exist_odd(A):
  for i in A:
    if i % 2 == 1:
      break
    return 1
  else:
    return 0
while exist_odd(A) ==0:
  A = list(map(lambda x: x / 2, A))
  t = t+1
print(t)

Submission status: Wrong Answer

Solution code:
N = int(input())
A = list(map(int, input().split()))
t = 0
def exist_odd(A):
  for i in A:
    if i % 2 == 1:
      break
    return 1
  else:
    return 0
while exist_odd(A) ==1:
  A = list(map(lambda x: x / 2, A))
  t = t+1
print(t)

Submission status: Wrong Answer

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

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

	count += 1

print(count)

Submission status: Wrong Answer

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

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

print(count)

Submission status: Wrong Answer

Solution code:
n=int(input())
p=list(map(int,input().split()))
p_=[]
b=True
c=0
while b:
  p_=list(map(lambda in_:type(in_)=="int",p))
  b = "False" in p_
  p_=list(map(lambda in_:in_/2,p))
  c+=1
print(c)

Submission status: Wrong Answer

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

for i in A:
    temp = format(i, 'b')
    print(temp)
    ans = min(ans, len(temp) - temp.rfind('1') - 1)

print(ans)

Submission status: Wrong Answer

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

n_divided = 0

# 1回も割れない場合
if 1 in a_list:
    print("0")
else: # 最低1回は割れる場合
    while 1:
        a_list = [x/2 for x in a_list]
        n_divided += 1
        for idx in range(len(a_list)):
            if a_list[idx] % 2 != 0:
                print(n_divided)
                exit()

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
# 自分の回答
n = int(input())
array = list(map(int, input().split()))
flg = 0
count = 0
while(flg == 0):
    j = 0
    for j in range(n):
        if(array[j] % 2 == 0):
            j += 1
            if(j == (n -1)):
                array[0] /= 2
                array[1] /= 2
                array[2] /= 2
                count += 1
        else:
            flg = 1
            break;
print(count)

Submission status: Wrong Answer

Solution code:
n = int(input())
 
counter = 0
Nums = [int(num) for num in input().split()]
for i in range(1, 9):
  odd_recorder = 0
  for j, num in enumerate(Nums):
    is_odd = num % 2
    Nums[j] //= 2
    odd_recorder += is_odd
  if odd_recorder != 0:
    counter = i - 1
    break
print(counter)

Submission status: Wrong Answer

Solution code:
n = int(input())

counter = 0
Nums = [int(num) for num in input().split()]
for i in range(1, 9):
  odd_recorder = 0
  for j, num in enumerate(Nums):
    is_odd = num % 2
    Nums[j] //= 2
    odd_recorder += is_odd
  print(Nums)
  print(odd_recorder)
  if odd_recorder != 0:
    counter = i - 1
    break
print(counter)

Submission status: Wrong Answer

Solution code:
n = int(input())

counter = 0
Nums = [int(num) for num in input().split()]
for i in range(1, 9):
  odd_recorder = 0
  for j, num in enumerate(Nums):
    is_odd = num % 2
    Nums[j] //= 2
    odd_recorder += is_odd
  print(Nums)
  print(odd_recorder)
  if odd_recorder != 0:
    counter = i - 1
    break

Submission status: Wrong Answer

Solution code:
#Shift only
N = input()
A = list(map(int,input().split()))
count = 0
for a in A:
    count_local = 0
    while a%2 == 0:
        a = a/2
        count_local += 1
        if count_local >= count:
            count = count_local

print(count - 1)

Submission status: Wrong Answer

Solution code:
N = input()
A = list(map(int,input().split()))
count = 0
for a in A:
    count_local = 0
    while a%2 == 0:
        a = a/2
        count_local += 1
        if count_local >= count:
            count = count_local

print(count)

Submission status: Wrong Answer

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

print(N)
print(li)

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

Submission status: Wrong Answer

Solution code:
n = int(input())
a = list(map(int, input().split()))
ans = 0
while True:
    i = 0
    while i <= n -1:
        if a[i]%2:
            a[i] = a[i]//2
        else:
            print(ans)
            exit()
        i += 1
    ans += 1

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

count = 0 
for i in range(N):
  tmp = As[i]
  tmp_count = 0
  while tmp % 2 == 0:
    tmp = tmp // 2
    tmp_count += 1
  count = min(count, tmp_count)
    
print(count)

Submission status: Wrong Answer

Solution code:
N = input() 
A = input().split()
count = 0

flg = False
tmp = A
for i in range(int(N)):
    List = []
    for Number in tmp:
        if  int(Number) % 2 != 0:
            flg = True
        else:
            List.append(int(Number) / 2)

    if flg == False:
        count += 1
        tmp = List

print(count)

Submission status: Wrong Answer

Solution code:
N = input() 
A = input().split()
count = 0

flg = False
for i in range(int(N)):

    for Number in N:
        if  int(Number) % 2 != 0:
            flg = True

    if flg == False:
        count += 1

print(count)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import sys
input = sys.stdin.readline

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

Submission status: Wrong Answer

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

for i,a in enumerate(A):
  A[i] = int(a)

flag = True
count = 0
while flag:
  for i in range(N):
    if A[i]%2 == 0:
      pass
    else:
      flag = False
      break
  count += 1
  
print(count)

Submission status: Wrong Answer

Solution code:
_ = input()
a = input()

a = a.split(" ")
b = []
d = 0
for i in a:
    if int(i)%2 == 0:
        b.append(int(i))
c = min(b)
while c%2 == 0:
    c = c/2
    d += 1
print(d)

Submission status: Wrong Answer

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

ans = 0

for i in range(len(a)):
    if a[i] % 2 == 0:
        a[i] = a[i] / 2
    else:
        break;
    ans += 1

print(ans)

Submission status: Wrong Answer

Solution code:
import numpy as np

n = int(input())
a = input().split()
a = [int(i) for i in a]
s = np.sum(a)
ans = 0
while s%2 == 0:
  ans += 1
  s /= 2

print(ans)

Submission status: Wrong Answer

Solution code:
import math

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

count=0

while True:
  for i in range(n):
    ch = False
    if a[i]%2 == 0:
      ch = True
  if ch == True:
    a[i] = math.ceil(a[i]/2)
    count +=1
  else:
    break


    
print(count-1)

Submission status: Wrong Answer

Solution code:
import math

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


all=[]

for i in range(n):
  if a[i]%2 ==0:
    count = 0
    while True:
      if (a[i]%2)==0:
        count+=1
        
        a[i]=math.ceil(a[i]/2)
        
      else:
        break
    all.append(count)
    
print(int((max(all)-1)))