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: Runtime Error

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

#A内のaすべてが偶数の場合
while all(a%2==0 for a in A):
    A = A // 2
    cnt += 1

print(cnt)

Submission status: Runtime Error

Solution code:
n=int(input())
a=[int(input()) for i in range(n)]

ans_list=[]
for j in range(n):
    m=0
    while a[j]%2==0:
        m+=1
        a[j]=a[j]//2
    ans_list.append(m)
ans_list.sort()
print(ans_list[0])

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
n = input()
num = [int(i) for i in input().split()]
count = 0
end=False
while(True):
	div = []
	for i in num:
		if(i % 2 == 0):
			div.append(i/2)
		else:
			print(count)
			end = True
                        break
	if(end == True):
		break
	num = div
	count = count + 1

Submission status: Runtime Error

Solution code:
count = 0
end=False
while(True):
	div = []
	for i in num:
		if(i % 2 == 0):
			div.append(i/2)
		else:
			print(count)
			end = True
                        break
	if(end == True):
		break
	num = div
	count = count + 1

Submission status: Runtime Error

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

count = 0
end=False
while(True):
	div = []
	for i in num:
		if(i % 2 == 0):
			div.append(i/2)
		else:
			print(count)
			end = True
            break
	if(end == True):
		break
	num = div
	count = count + 1

Submission status: Runtime Error

Solution code:
N = input()
num = input().split()

count = 0
end=False
while(True):
	div = []
	for i in num:
		if(i % 2 == 0):
			div.append(i/2)
		else:
			print(count)
			end = True
    if(end == True):
		break
	num = div
	count = count + 1

Submission status: Runtime Error

Solution code:
N = input()
num = input().split()

count = 0
end=False
while(True):
	div = []
	for i in num:
		if(i % 2 == 0):
			div.append(i/2)
		else:
			print(count)
			end = True
    if(end == True):
      break
	num = div
	count = count + 1

Submission status: Runtime Error

Solution code:
N = input()
num = input().split()

count = 0
while(True):
	div = []
	for i in num:
		if(i % 2 == 0):
			div.append(i/2)
    	else:
			print(count)
			break
	num = div
	count = count + 1

Submission status: Runtime Error

Solution code:
N = input()
num = input().split()

count = 0
while(True):
	div = []
	for i in num:
		if(i % 2 == 0):
			div.append(i/2)
    	else:
	  		print(count)
        	break
	num = div
	count = count + 1

Submission status: Runtime Error

Solution code:
N = input()
num = input().split()

count = 0
while(True):
	div = []
	for i in num:
		if(i % 2 == 0):
    		div.append(i/2)
    	else:
	  		print(count)
        	break
	num = div
	count = count + 1

Submission status: Runtime Error

Solution code:
N = input()
num = input().split()

count = 0
while(True):
	div = []
	for i in num:
	if(i % 2 == 0):
    	div.append(i/2)
    else:
	  	print(count)
        break
	num = div
	count = count + 1

Submission status: Runtime Error

Solution code:
N = input()
num = input().split()

count = 0
while(True):
	div = []
	for i in num:
	if(i % 2 == 0)
    	div.append(i/2)
    else:
	  	print(count)
        break
	num = div
	count = count + 1

Submission status: Runtime Error

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

A = np.array(A)

cnt = 0

while True:
  if (A%2).sum() == 0:
    A = A/2
    cnt += 1
  else
    break
print(cnt)

Submission status: Runtime Error

Solution code:
N = int(input())
x = list(map(int, input().split()))
mn_lst = []
for i in x:
    cnt = 0
    while i % 2 == 0:
        cnt += 1
        i >>= 1
    mn_lst.append(cnt)
    
print(min(mn_list))

Submission status: Runtime Error

Solution code:
N = int(input())
x = list(map(int, input().split()))
mn_lst = [0 for i in range(N)]
for i in x:
    cnt = 0
    while i % 2 == 0:
        cnt += 1
        i >>= 1
    mn_lst.append(cnt)
    
print(min(mn_list))

Submission status: Runtime Error

Solution code:
N = int(input())
x = list(map(int, input().split())
cnt = 0
mn_lst = []
for i in x:
    cnt = 0
    while i % 2 == 0:
        cnt += 1
        i <<= 1
    mn_lst.append(cnt)
print(min(mn_lst))

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
N = input()
data = list(map(lambda x :int(x)%2,input().strip().split("")))
res = sum(data)
if res ==1:
  print(0)
else:
  data.sort()
  tmp = data[0]
  cnt = 0
  while tmp!=1:
    tmp/=2
    cnt+=1
  print(cnt)

Submission status: Runtime Error

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

ans = float("ïnf")
for i in a:
    ans = min(ans, len(bin(i)) - bin(i).rfind("1") -1)

print(ans)

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
import sys
 
size = int(input())
a = map(int, input().split())
cnt = 0
 
while True:
  for i in range(size):
    if(a[i]%2 == 1):
      print(cnt)
      sys.exit()
    
  a = list(map(lambda x:x/2, a))
  cnt+=1

Submission status: Runtime Error

Solution code:
import sys

size = int(input())
a = map(int, input().split())
cnt = 0

while True:
  for i in range(size):
    if(a[i]%2 == 1):
      print(cnt)
      sys.exit()
    
  a = map(lambda x:x/2, a)
  cnt+=1

Submission status: Runtime Error

Solution code:
import sys

size = int(input())
a = map(int, input().split())
cnt = 0

while true:
	for i in range(size):
      if(a[i]%2 == 1):
        print(cnt)
        sys.exit()
    
    a = map(lambda x:x/2, a)
    cnt +=1

Submission status: Runtime Error

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

while(1):
  flg = 0
  for i in a:
    if(a%2 == 1):
      flg = 1
    else:
      i = i/2
      
  if(flg == 0):
    cnt += 1
  else:
    break

print(cnt)

Submission status: Runtime Error

Solution code:
N=int(input())
A=list(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: Runtime Error

Solution code:
N=int(input())
A=[input() for i in range(N)]
cnt=0

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

Submission status: Runtime Error

Solution code:
n = int(input())
li = input().split()

lians = [0]*n
for i in range(n):
  while li[i]%2 == 0:
    li[i] /= 2
    lians[i] += 1
print(max(lians))

Submission status: Runtime Error

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

count = -1
flag = True

while flag == True:
    count += 1
    for i in range(N):
        if A[i]%2 == 0:
            A[i] /= 2

        else:
            flag = False
            break



print(count)

Submission status: Runtime Error

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

count = 0
flag = True

while flag == True:
    for i in range(N):
        if A[i]%2 == 0:
            A[i] /= 2

        else:
            flag = False
            break

        count += 1

print(count)

Submission status: Runtime Error

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

count = 0
flag = True

while flag == True:
    for i in range(N):
        if A[i]%2 == 0:
            A[i] /= 2

        else:
            flag = False
            break

        count += 1

Submission status: Runtime Error

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

count=-1
while len(A)==N:
    count+=1
    for i in range(N-1):
        if A[i]%2==0:
            A[i]=A[i]/2
        else:
            A.remove(A[i])
print(count)

Submission status: Runtime Error

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

while True:
  if [i for i in a if a%2 == 1]:
    break
  a = [ i//2 for i in a]
  ans += 1
print(ans)

Submission status: Runtime Error

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

while True:
  if a%2 == 1:
    print(0)
  print(ans)
  ans += 1

Submission status: Runtime Error

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

print(ans)

Submission status: Runtime Error

Solution code:
from itertools import takewhile
from functools import reduce

data_num = int(input())
data_list = [bin(int(num)) for num in input().split(' ')]

combine_data = reduce(lambda x, y: x or y, data_list)

results = takewhile(lambda x: x == '0', combine_data[::-1])

print(len(results))

Submission status: Runtime Error

Solution code:
import numpy as np
N = int(input())
a  = [int(i) for i in input().split()]
b = np.zeros_like(a)
t = 0
while [i % 2 for i in a] == b:
  a = [i / 2 for i in a]
  t = t + 1
print(t)

Submission status: Runtime Error

Solution code:
n = input()
int_list = [int(input()) for i in range(n)]
count = 0
while True:
    isOdd = False
    for i in range(n):
        if(int_list[i] % 2 != 0):
            isOdd = True
    if isOdd:
        break
    for i in range(n):
        int_list[i] = int_list[i]/2
    count = count + 1

print(count)

Submission status: Runtime Error

Solution code:
import math
n = input()
a = list(map(int, input().split()))
ans = float("inf")
for i in a:
    b = len(bin(i)) - bin(i).rfind("1") - 1)
    ans = min(ans, b)
print(round(ans))

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

count = 0
for i in a:
  c = 0
  while i != 0 and i % 2 == 0:
    i /= 2
    c += 1
  if c <= count or count = 0:
    count = c
print(count)

Submission status: Runtime Error

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

z = 9

for i in range(n):
    m = a[i]
	cnt = 0

    if m % 2 == 0:
        while m % 2 == 0:
            m=m/2
            cnt += 1
    z = min(z,cnt)  

print(z)

Submission status: Runtime Error

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

n = int(raw_input())
a = map(int, raw_input().split())
ans = min(map(how_many_times_divisible, a))

print(ans)

Submission status: Runtime Error

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

n = int(raw_input())
a = map(int, raw_input().split())
ans = min(map(how_many_times_divisible, a))

print ans

Submission status: Runtime Error

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

n = int(raw_input())
a = map(int, input().split())
ans = min(map(how_many_times_divisible, a))

print ans

Submission status: Runtime Error

Solution code:
N = int(input())
nums = list(map(int, input().split()))
 
multi = reduce(mul, nums)
n = 0
while multi % 2 == 0:
  nums = [i/2 for i in nums]
  multi = reduce(mul, nums)
  n += 1

print(n)

Submission status: Runtime Error

Solution code:

N = int(input())
nums = list(map(int, input().split()))
 
multi = reduce(mul, nums)
n = 0
while multi % 2 == 0:
  nums = [i/2 for i in nums]
  multi = reduce(mul, nums)
  n += 1

print(n)

Submission status: Runtime Error

Solution code:

N = int(input())
nums = list(map(int, input().split()))
 
multi = reduce(mul, nums)
n = 0
while multi % 2 == 0:
  nums = [i/2 for i in nums]
  multi = reduce(mul, nums)
  n += 1
 
print(n)

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
from functools import reduce
from operator import mul

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

multi = reduce(mul, nums)
n = 0
while multi % 2 == 0:
  nums /= 2
  multi = reduce(mul, nums)
  n += 1

print(n)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
N = input()
A = list(input())
intA = [int(s) for s in A]
j = 1
c = 0
while j == 1 :
    for i in range(len(intA)):
        if(intA[i]%2==1):
            j = 0
        else:
            c += 1
print(c)

Submission status: Runtime Error

Solution code:
N=int(input())
A=list(map(int,input().split()))
ans=0
for i,j in enumerate(A):
    if j%2!=0:
        print(ans)
        exit()
    else:
        A[i]=j/2
    count+=1

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
n = int(input().rstrip())
values = list(map(int,input().rstrip().
    ssplit()))

m = 500000000 #max divide
for i in range(len(values)):
	nowV = values[i]
	nm = 0
	for j in range(500000000):
		if nowV % 2 == 0:
			nm += 1
			nowV = nowV / 2
			m = min(m,n)
		else:
			break 
print(m)

Submission status: Runtime Error

Solution code:
import numpy as np
N = input()
s = np.array(map(int, input().split()))
count = 0
while True:
  _exp = 2**(count+1)
  if np.all( s%_exp == 0):
    count += 1
  else:
    break
print(count)

Submission status: Runtime Error

Solution code:
import numpy as np
N = input()
s = np.array(map(int, input().split()))
count = 0
while True:
  if np.all( (s%2) == 0):
    count += 1
    s = s/2
  else:
    break
print(count)

Submission status: Runtime Error

Solution code:
import numpy as np
N = input()
s = np.array(map(int, input().split()))
count = 0
while True:
  if np.all( (s%2) == 0):
    count += 1
    s = s
  else:
    break
print(count)

Submission status: Runtime Error

Solution code:
import numpy as np
N = input()
s = map(int, input().split())
count = 0
while True:
  if np.all( (np.array(s)%2) == 0):
    count += 1
  else:
    break
print(count)

Submission status: Runtime Error

Solution code:
import numpy as np
N = input()
s = map(int, input().split())
count = 0
while True:
  if np.all( np.array(s)%2 == 0):
    count += 1
  else:
    break
print(count)

Submission status: Runtime Error

Solution code:
import numpy as np
N = input()
s = map(int, input().split())
count = 0
while True:
  if np.all(np.array(s)%2):
    count += 1
  else:
    break
print(count)

Submission status: Runtime Error

Solution code:
N = input()
s = map(int, input().split())
count = 0
while True:
  if np.all(np.array(s)%2):
    count += 1
  else:
    break
print(count)

Submission status: Runtime Error

Solution code:
s = map(int, input().split())
count = 0
while True:
  if np.all(np.array(s)%2):
    count += 1
  else:
    break
print(count)

Submission status: Runtime Error

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

for num in a:
  tmp = 0
  while num % 2 == 0:
    num /= 2
    tmp += 1
  	ans = min(tmp, ans)

print(ans)

Submission status: Runtime Error

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

for num in a:
  tmp = 0
  while num % 2 == 0:
    num /= 2
    tmp　+= 1
  	ans = min(tmp, ans)

print(ans)

Submission status: Runtime Error

Solution code:
n=int(input())
a=list(map(int, input().split()))
count=0 
def h(L):
  for i in range(len(L)):
    if L[i] % 2 != 0:
      return(1)
  return(0)
while h(a) == 0:
    a[j]=a[j]/2
  count=count+1
  
print(count)

Submission status: Runtime Error

Solution code:
n=int(input())
a=list(map(int, input().split()))
count=0 
def h(L):
  for i in range(len(L)):
    if L[i] % 2 != 0:
      return(1)
  return(0)
while h(a) == 0:
  for j in range(N):
    A[j]=A[j]/2
  count=count+1
  
print(count)

Submission status: Runtime Error

Solution code:
n=int(input())
a=list(map(int, input().split()))
count=0 
def h(L):
  for i in range(len(L)):
    if L[i] % 2 != 0:
      return 1
  return 0:
while h(a) == 0:
  for j in range(N):
    A[j]=A[j]/2
  count=count+1
  
print(count)

Submission status: Runtime Error

Solution code:
import numpy as np

n = int(input())
a = np.array(map(int, input().split()))
ans_count = 0

while:
  count = len(np.where(a % 2 == 1)[0])
  if count > 0:
    break
  a = a / 2
  ans_count += 1
print(ans_count)

Submission status: Runtime Error

Solution code:
input_num = int(input())
nums = input().split()
ope_cnt = 0
def division_nums(input_num, nums, ope_cnt):
  for i in range(input_num):
    if int(nums[i]) % 2 != 0:
      return ope_cnt
    else:
      nums[i] = int(nums[i]) / 2
  ope_cnt = ope_cnt + 1
  return division_nums(input_num, nums, ope_cnt)
      
print(divisiton_nums(input_num, nums, ope_cnt))

Submission status: Runtime Error

Solution code:
def gu(n,a):
  ans=[0]*n
  for i in len(len(a)):
    ii=a[i]
    while True:
      if ii%2==0:
        ans[i]+=1
      else:
        break
  return ans.min()
n=int(input())
a=list(map(int,input().split()))
print(gu(n,a))

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
N = int(input())
data = list(map(int,input().split()))
remain = [0]*N
res = 0
while max(remain) == 0:
    exist_odd: bool = False
    for i in range(N):
        if data[i]%2 == 1:
            exist_odd = True
    if exist_odd == True:
        break
        
    for i in range(N):
        data[i] = data[i]//2
    
    res += 1
        
print(res)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

j=0
l=0
for k in range(100):
    for i in range(A):
        if isinstance(B[i]/2,int):
            j=j+1
    
    if j!=A:
        print(l)
    l=l+1

Submission status: Runtime Error

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

j=0
l=0
for k in range(100):
    for i in range(A):
        if isinstance(B[i]/2,int):
            j=j+1
    
    if j!>A:
        print(l)
    l=l+1

Submission status: Runtime Error

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

j=0
l=0
for k in range(100)
    for i in range(A)
        if isinstance(B[i]/2,int):
            j=j+1
    
    if j!>A:
        print(l)
    l=l+1

Submission status: Runtime Error

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

ans=1000000000

for i in a:
  'print(i)
  count=0
  while i%2==0:
    count+=1
  
  ans = min(ans, count)

print(ans)

Submission status: Runtime Error

Solution code:
# B
n = int(input())
a = [int(i) for i in input().split()]
count = 0
flag = True
while flag:
    for i in range(len(a)):
        if a[i] % 2 == 0:
            continue
        else:
            flag  = False
            break
    a = map(lambda x: x / 2, a)
print(count)

Submission status: Runtime Error

Solution code:
N = int(input())
def calc(n):
    if n % 2:
        return 0
    else:
        return a(n//2) + 1

A = [int(a) for a in input().split()]
mi = 9999
for a in A:
    mi = min(mi, calc(a))
print(a)

Submission status: Runtime Error

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

min_ans = 0
for num in nums:
  ans = 0
  tmp = num % 2
  if (tmp == 1):
    break
  ans += 1
  while (tmp % 2 == 0 and ans <= min_ans):
    ans += 1
    tmp = tmp % 2

  if (ans < min_ans):
    min_ans = ans

print(min_ans)

Submission status: Runtime Error

Solution code:
N = input()

number=[]
for _ in range(N):
  num = int(input())
  number.append(num)
for i in number:
  if i%2 == 0:
    counter += 1
print

Submission status: Runtime Error

Solution code:
N = input()
number=[]
for i in range(N):
  num = input()
  number.append(num)
if map(lambda x: x%2 == 0, number):
	counter += 1
print(counter)

Submission status: Runtime Error

Solution code:
N = input()
number=[]
for i in range(N):
  num = input()
  number.append(num)
while map(number%2 == 0):
  for _ in range(N):
    if map(number%2 == 0):
      counter += 1
print(counter)

Submission status: Runtime Error

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

count=0

while True:
  for i in range(len(l)):
    if l[i]%2==0:
        l[i] //= 2
        else:
            print(count)
            exit()
    count += 1

Submission status: Runtime Error

Solution code:
N=int(input())
lst=[int(i) for i in input().split()]
for i in range(n):
  lst[i]=lst[i]//2
print(min(ans))

Submission status: Runtime Error

Solution code:
cnt = 0

while(True):
    
    if all(a % 2 == 0 for a in A):
        A = list(map(lambda x: x / 2, A))
        cnt += 1
    
    else: break

print(cnt)

Submission status: Runtime Error

Solution code:
N = input()
A = list(map(int,input().split()))
#２の倍数かどうかを調べる関数　引数:4→True,5→False

def isAllEVEN(A):
    return (not (False in (list(map(lambda x:x%2==0,A)))))

i = 0
while(isAllEVEN(A)):
	A = list(map(lambda x:x/2,A))
    i++;
print(i)

Submission status: Runtime Error

Solution code:
N = input()
A = list(map(int,input().split()))
#２の倍数かどうかを調べる関数　引数:4→True,5→False

def isAllEVEN(A):
    return (not (False in (list(map(lambda x:x%2==0,A)))))

i = 0
while(isAllEVEN(A)):
A = list(map(lambda x:x/2,A))
    i++;

Submission status: Runtime Error

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

count = 0
can = True
while can:
  for i in range(0, n):
    a = list[i]
    if a % 2 == 0:
      list[i] = a / 2
    else:
      can = False
  if can == True:
    count += 1
print(count)

Submission status: Runtime Error

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

for i in range (n) :
    number = 0
    odd = a[i] %% 2
    a[i] = a[i] / 2    
    while odd <= 0 :
        number += 1
        odd = a[i] %% 2
        a[i] = a[i] / 2
    answer.append(number)

#print(answer)
print(min(answer))

Submission status: Runtime Error

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

count = 0
can = True
while can:
  for i in range(0, 6):
    a = list[i]
    if a % 2 == 0:
      list[i] = a / 2
    else:
      can = False
  if can == True:
    count += 1
print(count)

Submission status: Runtime Error

Solution code:
n = input()
list = input().split()

count = 0
can = True
while can:
  for i in range(0, 6):
    a = int(list[i])
    if a % 2 == 0:
      list[i] = a / 2
    else:
      can = False
  if can == True:
    count += 1
print(count)

Submission status: Runtime Error

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

count = [0] * N
for i in range(N):
  while(a[i] % 2== 0):
    a[i] = a[i] // 2
    count[i] += 1
print(np.min(count))

Submission status: Runtime Error

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

count = [0] * N
for i in range(N):
  while(a[i] % 2== 1):
    a[i] = a[i] // 2
    count[i] += 1
print(np.min(count))

Submission status: Runtime Error

Solution code:
import numpy　as np
N = int(input())
a = int(list(input()))

count = [0] * N
for i in range(N):
  while(a[i] % 2== 1):
    a[i] = a[i] // 2
    count[i] += 1
print(np.min(count))

Submission status: Runtime Error

Solution code:
import numpy　as np
N = int(input())
a = int(list(input())

count = [0] * N
for i in range(N):
  while(a[i] % 2== 1):
    a[i] = a[i] // 2
    count[i] += 1
print(np.min(count))

Submission status: Runtime Error

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

count = [0] * N
for i in range(N):
  while(a[i] % 2== 1):
    a[i] = a[i] // 2
    count[i] += 1
print(np.min(count))

Submission status: Runtime Error

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

count = [0] * N
for i in range(N):
  while(a[i] % == 1):
    a[i] = a[i] // 2
    count[i] += 1
print(np.min(count))

Submission status: Runtime Error

Solution code:
##いろいろやってみよう
import functools
def mod(a,b):
  c=a%b
  return c
N=int(input())
*A,=map(mod,input().split())
count=0
for j in range(len(bin(max(A)))-2):
  if 1 in map(functools.partial(mod,b=2),A)):
    break
  else:
    A=[A[i]//2 for i in range(N)]
    count+=1
print(count)

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
"""Shift Only
【問題概要】
黒板に N 個の正の整数 A1,…,AN が書かれています。
すぬけ君は，黒板に書かれている整数がすべて偶数であるとき，次の操作を行うことができます。

黒板に書かれている整数すべてを，2 で割ったものに置き換える。
すぬけ君は最大で何回操作を行うことができるかを求めてください。

【制約】

1≤N≤2001≤N≤200
1≤Ai≤1091≤Ai≤109
【数値例】
1)
　N=3
　A=(16,12,24)
"""
N = int(input())
A = list(map(int, input().split(',')))

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

Submission status: Runtime Error

Solution code:
def check(a,cnt)
  b = [int(x)%2 for x in a]
  if 1 in b:
    return 0,cnt
  else :
    cnt +=1
    b = [int(x)/2 for x in a]
    return 1,cnt

N = input()
a = input().split()
cnt = 0
while(1):
  m,cnt = check(a,cnt)
  if m == 0:
    print(cnt)
  else :
    continue

Submission status: Runtime Error

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

while i <len(l):
    if l[i]%2!=0:
        break
    else:
        l[i]=int(l[i]/2)
        i+=1
    ans+=1
print(ans)

Submission status: Runtime Error

Solution code:
import numpy as np
N=input()
a=list(map(int,input().split(",")))
a=np.asarray(a)
b=0
while True:
    if all(a%2==0):
        a=a/2
        b+=1
    else:
        break
print(b)

Submission status: Runtime Error

Solution code:
import numpy as np
N=input()
a=list(map(int,input().split(",")))
a=np.asarray(a)
b=0
while True:
  if all(a%2==0):
    a=a/2
    b+=1
  else:
    break
print(b)

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
N = int(input())
vals = map(int, input().split())
result = 1000000
for i in range(0, N):
    val = vals[i]
    count = 0
    while True:
        if val % 2 == 1:
            break
        val /= 2
        count += 1
    if result > count:
        result = count
print (result)

Submission status: Runtime Error

Solution code:
N = input()
vals = map(int, input().split())
result = 1000000
for i in range(0, N):
    val = vals[i]
    count = 0
    while True:
        if val % 2 == 1:
            break
        val /= 2
        count += 1
    if result > count:
        result = count
print (result)