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 = list(map(int, input().split()))
n_operation = 0
for i in range(n):
    even_len = len([a for a in a_list if a % 2 == 0])
    if len(a_list) != even_len:
        print(n_operation)
        exit()
    else:
        a_list = [a / 2 for a in a_list]
        n_operation += 1

print(n_operation)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
n = input()
il = list(map(int, input().split()))
ans = 0
fin = 0

while fin < 1:
    cnt = 0                                                                                                       
    for i in range(len(il)):
        if il[i] % 2:
            fin = 1
            break
        else:
            cnt += 1

    print(cnt, len(il))
    if cnt == len(il):
        for i in range(len(il)):
            il[i] = il[i] / 2
        ans += 1
    else:
        break

print(ans)

Submission status: Wrong Answer

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

while True:
    for i in range(len(il)):
        if il[i] % 2:
            break
        else:
            cnt += 1
    if cnt == len(il):                                                                                            
        for i in range(len(il)):
            il[i] == il[i] / 2
        ans += 1

    break

print(ans)

Submission status: Wrong Answer

Solution code:
N = int(input())
a = list(map(int,input().split()))
count=0
hantei = [i%2 for i in a]

while sum(a)%2 ==0 and sum(hantei)==0:
    if sum(a)%2 ==0:
        a = [i/2 for i in a]
        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:
    if sum(a)%2 ==0:
        a = [i/2 for i in a]
        count+=1
print(count)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
_ = input()
num_list = input().split(" ")
num_list = list(map(lambda x:int(x), num_list))
 
shift_counter = 0
 
while(True):
  if sum(num_list) % 2 != 0:
    break
  
  num_list = [x / 2 for x in num_list]
  shift_counter += 1
 
print(shift_counter)

Submission status: Wrong Answer

Solution code:
_ = input()
num_list = input().split(" ")
num_list = list(map(lambda x:int(x), num_list))
min_num = min(num_list)

shift_counter = 0

while(True):
  if min_num == 1:
    break
  
  min_num /= 2
  shift_counter += 1

print(shift_counter)

Submission status: Wrong Answer

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

for j in range(1, 30):
    for i in range(n):
        if a[i] % 2 == 1:
            print(j - 1)
            exit()
        else:
            a[i] = a[i] // 2

Submission status: Wrong Answer

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

def devide(array, count):
	print(array);
	dividable = True
	for i in array:
		if ((i % 2) != 0):
			dividable = False
	if (dividable):
		print('a')
		for index, value in enumerate(array):
			array[index] = value / 2
		count += 1
		return devide(array, count)
	else:
		print('b')
		print(array)
		print(count)
		return array, count

devided, count = devide(A, 0)
print(count)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
N=int(raw_input())
A=map(int,raw_input().split())
def f(x):
  cnt = 0
  while x >= 2:
    x /= 2
    cnt += 1
  return cnt
C=map(f,A)
print min(C)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
n = int(input())
l = list(map(int,input().split()))
k = 0
m = 0
for _ in range(100):
    for i in range(len(l)) :
        if l[i] % 2 != 0:
            m += 1
            break
        elif l[i] == 2:
            m += 1
            break
        else:
            l[i] = l[i]/2
    if m != 0 :
        break
    k += 1
print(k)

Submission status: Wrong Answer

Solution code:
n = int(input())
l = list(map(int,input().split()))
k = 0
m = 0
for _ in range(100):
    for i in range(len(l)) :
        if l[i] % 2 != 0:
            m += 1
            break
        elif l[2] == 2:
            m += 1
            break
        else:
            l[i] = l[i]/2
    if m != 0 :
        break
    k += 1
print(k)

Submission status: Wrong Answer

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

for i in l :
    if i % 2 != 0:
        break
    elif i == 2:
        break
    i = i/2
    k += 1
print(k)

Submission status: Wrong Answer

Solution code:
def num_2n(i):
    count = 0
    while(i % 2 == 0):
        i = i / 2
        count += 1
    return count



def main():
    num_ans = int(input())
    ans_list = list(map(int, input().split()))
    num_2n_list =[]
    for i in ans_list:
        num_2n_list.append(num_2n(i))
    num_2n_list.sort()
    num_2n_list.reverse()
    print(num_2n_list[0])


if __name__ == '__main__':
    main()

Submission status: Wrong Answer

Solution code:
def num_2n(i):
    count = 0
    while(i % 2 == 0):
        i = i / 2
        count += 1
    return count



def main():
    num_ans = int(input())
    ans_list = list(map(int, input().split()))
    num_2n_list =[]
    for i in ans_list:
        num_2n_list.append(num_2n(i))
    num_2n_list.reverse()
    print(num_2n_list[0])


if __name__ == '__main__':
    main()

Submission status: Wrong Answer

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

count = 0
for i in num_list:
  if i % 2 == 0:
    count += 1
    # print(count)
  else:
    print(0)
    break

count_s = 0
if count == number:
  num_min = min(num_list)
  while True:
    num_min = num_min / 2
    count_s += 1
    if num_min % 2 != 0:
        print(count_s)
        break

Submission status: Wrong Answer

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

count = 0
for i in num_list:
  if i % 2 == 0:
    count += 1
    # print(count)
  else:
    print(0)
    break

count_s = 0
if count == number:
  num_min = min(num_list)
  while num_min % 2 == 0:
    num_min = num_min / 2
    count_s += 1
  print(count_s)

Submission status: Wrong Answer

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

count = 0
for i in num_list:
  if i % 2 == 0:
    count += 1
    # print(count)
  else:
    print(0)
    break

count_s = 0
if count == number:
  num_min = min(num_list)
  while num_min > 1:
    num_min = num_min / 2
    count_s += 1
  print(count_s)

Submission status: Wrong Answer

Solution code:
A = list(map(int,input().split()))
cnt=0
ans=0
wh=1
while(wh==1):
    for j in range(len(A)):
        if A[j]%2==0:
            cnt+=1
            A[j]=A[j]/2
        else: wh=0
        if (j==len(A)-1 and cnt==len(A)):
            cnt=0
            ans+=1
print(ans)

Submission status: Wrong Answer

Solution code:
A = list(map(int,input().split()))
cnt=0
ans=0
wh=1
while(wh==1):
    for j in range(len(A)):
        if A[j]%2==0:
            cnt+=1
            A[j]=A[j]/2
        else: wh=0
        if (j==len(A)-1 and cnt==len(A)):
            cnt=0
            ans+=1
print(A,ans)

Submission status: Wrong Answer

Solution code:
input_num = input()
input = input().split()

times = 0
i = 0

while True:
  if int(input[i]) % 2 == 0:
    i += 1
    if i == int(input_num) - 1:
      i = 0
      times += 1
  else:
    break
  break

print(times)

Submission status: Wrong Answer

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

output = 0
flag = True

while flag:
  for i in range(0, a):
    if b[i] % 2 == 0:
      b[i] = b[i] / 2
      if i == a - 1:
        output += 1        
    else:
      flag = False

print(output)

Submission status: Wrong Answer

Solution code:
n = int(input())
lines = input().split(' ')
lines = [int(x) for x in lines]

count = 0
while sum(lines)%2 == 0:
	count += 1
	lines = [x/2 for x in lines]
print(count)

Submission status: Wrong Answer

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

count = 0
is_succses = True

while is_succses:
	count += 1
	for i, x in enumerate(ls):
		if x % 2 == 0:
			is_succses = True
			ls[i] = int(x / 2)
		else:
			is_succses = False
			break

print(count - 1)

Submission status: Wrong Answer

Solution code:
n=int(input())
a=list(map(int, input().split()))
count=0
while sum(a)%2==0:
    a=[i//2 for i in a]
    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:
    a=[i/2 for i in a]
    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:
    a=[i/2 for i in a]
    count+=1
    print(a)
print(count)

Submission status: Wrong Answer

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

counter = 0

while True:
    exist_odd = False

    for i in range(n):
        if (a[i] % 2 != 0):
            exist_odd = True

    if exist_odd:
        break

    for i in range(n):
        a[i] = a[i] // 2

    counter += 1

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
from functools import reduce

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

print(A)

cnt = 0
while reduce(lambda x, y: x and y, [n % 2 == 0 for n in A]):
    A = [n // 2 for n in A]
    cnt += 1

print(cnt)

Submission status: Wrong Answer

Solution code:
import math
s = list(map(int, input().split()))
ans = float('inf')

for i in s:
    ans = min(ans, len(bin(i)) - bin(i).rfind("1") - 1)
print(ans)

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, math.floor(math.log2(i)))
print(round(ans))

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, math.floor(math.log2(i)))
print(ans)

Submission status: Wrong Answer

Solution code:
N=int(input())
input_list = sorted(list(map(int,input().split())))
def temp_func_div(x):
    return divmod(x, 2)[0]
def temp_func_mod(x):
    return divmod(x, 2)[1]

count_flag = 0
input_mod_list = list(map(lambda x: temp_func_mod(x), input_list))
if sum(input_mod_list)==0:
    print(0)
    pass
else:
    for i in range(40):
        if sum(input_mod_list) == 0:
            input_list = list(map(lambda x: temp_func_div(x), input_list))
            input_mod_list = list(map(lambda x: temp_func_mod(x), input_list))
            count_flag += 1
        else:
            break

    print(count_flag)

Submission status: Wrong Answer

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

def temp_func_div(x):
    return divmod(x, 2)[0]
def temp_func_mod(x):
    return divmod(x, 2)[1]
  
count_flag = 0
for i in range(40):
    input_list = list(map(lambda x: temp_func_div(x), input_list))
    input_mod_list = list(map(lambda x: temp_func_mod(x), input_list))
    count_flag += 1
    if sum(input_mod_list) == 0:
        pass
    else:
        break

print(count_flag)

Submission status: Wrong Answer

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

def temp_func_div(x):
    return divmod(x, 2)[0]
def temp_func_mod(x):
    return divmod(x, 2)[1]
  
count_flag = 0
for i in range(32):
    input_list = list(map(lambda x: temp_func_div(x), input_list))
    input_mod_list = list(map(lambda x: temp_func_mod(x), input_list))
    count_flag += 1
    if sum(input_mod_list) == 0:
        pass
    else:
        break

print(count_flag)

Submission status: Wrong Answer

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

def temp_func_div(x):
    return divmod(x, 2)[0]
def temp_func_mod(x):
    return divmod(x, 2)[1]
  
count_flag = 0
for i in range(31):
    input_list = list(map(lambda x: temp_func_div(x), input_list))
    input_mod_list = list(map(lambda x: temp_func_mod(x), input_list))
    count_flag += 1
    if sum(input_mod_list) == 0:
        pass
    else:
        break

print(count_flag)

Submission status: Wrong Answer

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

# AtCoder Beginner Contest
# Problem B


def count_operation(numbers):
    divided_count = 0
    odd_number_count = 0

    while odd_number_count == 0:
        numbers = [number / 2 for number in numbers]

        for number in numbers:
            if number % 2 != 0:
                odd_number_count += 1
                break

        divided_count += 1
    return divided_count


if __name__ == '__main__':
    number_count = int(input())
    numbers = list(map(int, input().split()))

    divided_count = count_operation(numbers)

    print(divided_count)

Submission status: Wrong Answer

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

while True:
 for i in range(n):
  if a[i] & 1:
    print(i)
    __import__("sys").exit(0)
  a[i] //= 2

Submission status: Wrong Answer

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

for i in range(n):
 if a[i] & 1: break
 a[i] //= 2
print(i)

Submission status: Wrong Answer

Solution code:
n=int(input())
s=sum(list(map(int,input().split())))
c=0
while s%2==0:
    s=s/2
    c+=1
print(c)

Submission status: Wrong Answer

Solution code:
n=int(input())
s=sum(list(map(int,input().split())))
c=0
for v in range(10**9):
    if s%2==0:
        s=s/2
        c+=1
    else:
        break
print(c)

Submission status: Wrong Answer

Solution code:
import math as m
n = int(input())
numbers =[int(i) for i in input().split()]
order = []
 
for i in range(n):
  if numbers[i] == 0:
    a = 0
  else:
    a = m.floor(m.log(numbers[i],2))
  order.append(a)
print(min(order))

Submission status: Wrong Answer

Solution code:
import math

N = input()
A = list(map(int, input().split()))
n = 0
d = 0

while n >= 0:
    for a in A:
        if a%2 == 1:
            print(n)
            d += 1
    if d > 0:
        break
    A = [a/2 for a in A] #Aを2で割る
    n += 1

Submission status: Wrong Answer

Solution code:
# -*- coding: utf-8 -*-
n = input()
x = list(map(int, input().split()))

cnt = 0

while True:
    print(x)
    s = sum(list(map(lambda elem: elem % 2, x)))
    if s != 0:
        break
    cnt += 1
    x = list(map(lambda elem: elem // 2, x))

print(cnt)

Submission status: Wrong Answer

Solution code:
n =int(input())
nums = input().split(" ")
nums =[int(i) for i in nums]
cheak =0
counter=0
while(cheak==0):
    for i in nums:
        cheak = cheak + i%2
    print(counter)
    nums = [i/2 for i in nums]
    if(cheak==0):
        counter +=1
print(counter)

Submission status: Wrong Answer

Solution code:
a=int(input())
rist=input().split()

b=0
c=0

for i in range (a):
    b=b+int(rist[i])


while 1:
    if b%2==0:
        b=b/2
        c=c+1

    elif b%2==1:
        break

print(c)

Submission status: Wrong Answer

Solution code:
#ABC081B
import sys

n=int(raw_input())
a=map(int,raw_input().split())
res=0
for i in xrange(27):
 for j in xrange(n):
  if a[j]%2:
   print res
   sys.exit()
  else:
   a[j]/=2
 res+=1
print res

Submission status: Wrong Answer

Solution code:
#ABC081B
import sys

n=int(raw_input())
a=map(int,raw_input().split())
res=0
for i in xrange(1,27):
 for j in xrange(n):
  if a[j]%2:
   print res
   sys.exit()
  else:
   a[j]/=2
 res+=1
print res

Submission status: Wrong Answer

Solution code:
#ABC081B
import sys

n=int(raw_input())
a=map(int,raw_input().split())
res=0
for i in xrange(1,26):
 for j in xrange(n):
  if a[j]%2:
   print res
   sys.exit()
  else:
   a[j]/=2
 res+=1
print res

Submission status: Wrong Answer

Solution code:
N = int(input())
a = input().split(' ')
c = 0


def check(a):
    global c


    for i in a:
        if int(i) % 2 == 1:
            return
        else:
            a[a.index(i)] = int(i)/2
            if int(i)/2 == 1:
                c += 1
                return
    c += 1
    check(a)


check(a)
print(c)

Submission status: Wrong Answer

Solution code:
N = int(input())
a = input().split(' ')
c = 0


def check(a):
    global c


    for i in a:
        if int(i) % 2 == 1:
            return
        else:
            a[a.index(i)] = int(i)/2
            if int(i)/2 == 1:
                return
    c += 1
    check(a)


check(a)
print(c)

Submission status: Wrong Answer

Solution code:
N = int(input())
a = input().split(' ')
b = 0
for i in a:
    b += int(i)

if b%2 == 0:
    print(min(int(i) for i in a)//2)
else:
    print(0)

Submission status: Wrong Answer

Solution code:
N = int(input())
a = input().split(' ')

print(min(int(i) for i in a)//2)

Submission status: Wrong Answer

Solution code:
import numpy as np
N = list(input())
a = list(map(int,input().split()))

for i in range(1,30):
  b = np.array([n/2 if n%2==0 else 0 for n in a])
  a = b
  if 0 in list(b):
    print(i-1)
    exit()

Submission status: Wrong Answer

Solution code:
import numpy as np
N = list(input())
a = list(map(int,input().split()))

for i in range(1,11):
  b = np.array([n/2 if n%2==0 else 0 for n in a])
  a = b
  if 0 in list(b):
    print(i-1)
    exit()

Submission status: Wrong Answer

Solution code:
import numpy as np
N = list(input())
a = list(map(int,input().split()))

for i in range(1,10):
  b = np.array([n/2 if n%2==0 else 0 for n in a])
  a = b
  if 0 in list(b):
    print(i-1)
    exit()

Submission status: Wrong Answer

Solution code:
import numpy as np
N = list(input())
a = list(map(int,input().split()))
     
for i in range(10):
  b = np.array([n/2 if n%2==0 else 0 for n in a])
  a = b
  if 0 in list(b):
    print(i)
    exit()

Submission status: Wrong Answer

Solution code:
import numpy as np
N = list(input())
a = list(map(int,input().split()))

for i in range(1,10):
  print(i)
  b = np.array([n/2 if n%2==0 else 0 for n in a])
  a = b
  if 0 in list(b):
    print(i-1)
    exit()

Submission status: Wrong Answer

Solution code:
import numpy as np
N = list(input())
a = list(map(int,input().split()))

for i in range(10):
  b = np.array([n/2 if n%2==0 else 0 for n in a])
  a = b
  if 0 in list(b):
    print(i)
    exit()

Submission status: Wrong Answer

Solution code:
N = input()
F = map(int, raw_input().split())

for x in xrange(29):
    if [y for y in F if y%(2 ** (x + 1))]:
        break

print x

Submission status: Wrong Answer

Solution code:
# coding: utf-8

N = input()
array1 = input().split()
array = list(array1)
chk = 0

if (int(array[0])%2) != 0:
	print("0")
else:
	flg = 0
	mini1 = min(array)
	mini = int(mini1)
	while 1:
		if mini == 0:
			break
		if mini%2 != 0:
			chk +=1
			break
		if chk ==1:
			break
		mini = mini/2
		flg +=1
		

	print(flg)

Submission status: Wrong Answer

Solution code:
# coding: utf-8

N = input()
array1 = input().split()
array = list(array1)
chk = 0

if (int(array[0])%2) != 0:
	print("0")
else:
	flg = 0
	mini1 = min(array)
	mini = int(mini1)
	while 1:
		if mini%2 != 0:
			chk +=1
			break
		if chk ==1:
			break
		mini = mini/2
		flg +=1
		if mini == 0:
			break

	print(flg)

Submission status: Wrong Answer

Solution code:
# coding: utf-8

N = input()
array1 = input().split()
array = list(array1)
chk = 0

if (int(array[0])%2) != 0:
	print("0")
else:
	flg = 0
	mini1 = min(array)
	mini = int(mini1)
	while 1:
		print(mini)
		if mini%2 != 0:
			break
		if mini == 0:
			break
		mini = mini/2
		flg +=1
		
		if mini == 0:
			break

	print(flg)

Submission status: Wrong Answer

Solution code:
# coding: utf-8

N = input()
array1 = input().split()
array = list(array1)
chk = 0

if (int(array[0])%2) != 0:
	print("0")
else:
	flg = 0
	mini1 = min(array)
	mini = int(mini1)
	while 1:
		print(mini)
		if mini%2 != 0:
			break
		mini = mini/2
		flg +=1
		
		if mini == 0:
			break

	print(flg)

Submission status: Wrong Answer

Solution code:
C=int(input())
D=list(map(int,input().split()))
S=0
flag=0
while(flag==0):
	for I in range(C):
		if D[I]%2==0:
			D[I]/=2
			if I==(C-1):
				S+=1
		else:
			flag=1
			break
	print(D,S)	
print(S)

Submission status: Wrong Answer

Solution code:
# coding: utf-8

N = input()
array1 = input().split()
array = list(array1)
chk = 0

if (int(array[0])%2) != 0:
	print("0")
else:
	flg = 0
	mini1 = min(array)
	mini = int(mini1)
	while 1:
		mini = mini/2
		flg +=1
		if mini%2 != 0:
			chk +=1
			break
		if chk ==1:
			break
		if mini == 0:
			break

	print(flg)

Submission status: Wrong Answer

Solution code:
# coding: utf-8

N = input()
array1 = input().split()
array = list(array1)
chk = 0

if (int(array[0])%2) != 0:
	print("0")
else:
	flg = 0
	mini1 = min(array)
	mini = int(mini1)
	while 1:
		mini = mini/2
		flg +=1
		if mini%2 != 0:
			chk +=1
			break
		if chk ==1:
			break

	print(flg)

Submission status: Wrong Answer

Solution code:
# coding: utf-8

N = input()
array1 = input().split()
#array2 = int(array1)
array = list(array1)
chk = 0

if (int(array[0])%2) != 0:
	print("0")
else:
	flg = 0
	mini1 = min(array)
	mini = int(mini1)
	while 1:
		mini = mini/2
		flg +=1
		if mini%2 != 0:
			break

	print(flg)

Submission status: Wrong Answer

Solution code:
# coding: utf-8

N = input()
array1 = input().split()
#array2 = int(array1)
array = list(array1)
chk = 0

if (int(array[0])%2) is not 0:
	print("0")
else:
	flg = 0
	mini1 = min(array)
	mini = int(mini1)
	while 1:
		mini = mini/2
		flg +=1
		if mini%2 is not 0:
			break

	print(flg)

Submission status: Wrong Answer

Solution code:
# coding: utf-8

N = input()
array1 = input().split()
#array2 = int(array1)
array = list(array1)
chk = 0

if (int(array[0])%2) is not 0:
	print("0")
else:
	flg = 0
	mini1 = min(array)
	mini = int(mini1)
	while 1:
		mini = mini/2
		flg +=1
		if mini%2 != 0:
			break

	print(flg)

Submission status: Wrong Answer

Solution code:
N=int(input())
suji=input()
I1=suji.split(" ")
I=list(map(int,I1))
wari=2
n=0
kazu=0
X=1
while n<3:
    if I[n]%wari==0:
        n+=1
        if I[N-1]%2==0:
            wari=wari*2
            kazu+=1
            n=0
    else:
        X=0
        break
print(kazu)

Submission status: Wrong Answer

Solution code:
# coding: utf-8

N = input()
array1 = input().split()
array2 = map(int,array1)
array = list(array2)
resalt = []
chk = 0

if array[0]/2 != 0:
	print("0")
else:
	flg = 0
	mini = min(array)
	while 1:
		mini = mini/2
		flg +=1
		if mini/2 != 0:
			break

	print(flg)

Submission status: Wrong Answer

Solution code:
# coding: utf-8

N = input()
array1 = input().split()
array2 = map(int,array1)
array = list(array2)
resalt = []
chk = 0

if array[0]/2 != 0:
	print("0")
else:
	flg = 0
	while 1:
		array = array/2
		flg += 1
		for i in range(N):
			if array[i]/2 != 0:
				chk +=1
				break
		if chk ==1:
			break
	
	print(flg)

Submission status: Wrong Answer

Solution code:
# coding: utf-8

N = input()
array1 = input().split()
array2 = map(int,array1)
array = list(array2)
resalt = []

if array[0]/2 != 0:
	print("0")
else:
	flg = 0
	while 1:
		array = array/2
		flg += 1
		for i in range(N):
			if array[i]/2 != 0:
				break
	print(flg)

Submission status: Wrong Answer

Solution code:
# coding: utf-8

N = input()
array1 = input().split()
array2 = map(int,array1)
array = list(array2)
resalt = []

if array[0] != (array[0]/2==0):
	print("0")
else:
	flg = 0
	while 1:
		array = array/2
		flg += 1
		for i in range(N):
			if array[i]/2 != 0:
				break
	print(flg)

Submission status: Wrong Answer

Solution code:
N = int(input())
P = list(map(int,input().split()))
S = []
a = 0
p = 0
s = 0
t = 1000000000000000000
for i in range(len(P)):
        while P[i] % 2 == 0:
            p = P[i] / 2
            P[i] = p
            a += 1
            s = max(s, a)
        a = 0    
        t = min(t, s)
if t > 1:
    t -= 1
print(t)

Submission status: Wrong Answer

Solution code:
N=int(input())
AS=map(int,input().split())
tw=[]
for num in AS:
    cnt=0
    while num%2>0:
        cnt+=1
    tw.append(cnt)
print(min(tw))

Submission status: Wrong Answer

Solution code:
N = int(input())
P = list(map(int,input().split()))
S = []
a = 0
p = 0
s = 0
t = 1000000000000000000
for i in range(len(P)):
        while P[i] % 2 == 0:
            p = P[i] / 2
            P[i] = p
            a += 1
            s = max(s, a)
        a = 0    
        t = min(t, s)
if t > 0:
    t -= 1
print(t)

Submission status: Wrong Answer

Solution code:
N = int(input())
P = list(map(int,input().split()))
S = []
a = 0
p = 0
s = 0
t = 100000000
for i in range(len(P)):
        while P[i] % 2 == 0:
            p = P[i] / 2
            P[i] = p
            a += 1
            s = max(s, a)
        a = 0    
        t = min(t, s)
if t > 0:
    t -= 1
print(t)

Submission status: Wrong Answer

Solution code:
N = input()
A = list(map(int, input().split()))
judge = lambda x : x%2==0
calc = lambda x : x/2

jd = list(map(judge, A))
cnt = 0

if all(jd):
  ans = list(map(calc, A))
  cnt = 1
while all(jd):
  jd = list(map(judge, jd))
  ans = list(map(calc, ans))
  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):
 if sum([i%2 for i in A])>0:
  print(i)
  break
 else: A = [i/2 for i in A]

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
N = int(input())
P = list(map(int,input().split()))
S = []
a = 0
p = 0
for j in range(10000):
    for i in range(len(P)):
        s = P[0] / 2
        S.append(s)
        P = S
        S = []
        if P[0] % 2 != 0:
            p = 1
            break
        a += 1
    if p == 1:
            break
    
print(a)

Submission status: Wrong Answer

Solution code:
N = input()
A = list(map(int, input().split()))
judge = lambda x : x%2==0
calc = lambda x : x/2

ans = list(map(judge, A))
cnt = 0

while all(ans):
  ans = list(map(judge, ans))
  ans = list(map(calc, ans))
  cnt += 1

print(cnt)

Submission status: Time Limit Exceeded

Solution code:
n = int(input())
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: Time Limit Exceeded

Solution code:
n = int(input())
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: Time Limit Exceeded

Solution code:
N = int(input())
A = map(int, input().split())
count = 0
while all(elem % 2 == 0 for elem in A):
  count+=1
  A = map(lambda x: x / 2, A)
print(count)

Submission status: Time Limit Exceeded

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

print(count)

Submission status: Time Limit Exceeded

Solution code:
def index(x):
    y = x//2
    return y

n = int(input())
a = list(map(int, input().split()))
count = 0
b = 1
while b >= 1:
    for i in a:
        if i % 2 != 0:
            b = 0
            break
    else:
        a = map(index, a)
        count += 1
print(count)