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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
_,*a=open(0);print(min((int(x)&-int(x)).bit_length()for x in a)-1)

Submission status: Runtime Error

Solution code:
from sympy import factorint
n=int(input())
A=list(map(int,input().split(' ')))
ans = []
for i in A:
    tmp = factorint(i)
    ans.append(tmp[2])
print(min(ans))

Submission status: Runtime Error

Solution code:
mylist = []
for i in range(0, 2):
    val = input()
    if val:
        mylist.append(val)
a = mylist[1:]

cnt = 0
while True:
    if all(map(lambda x: x % 2 == 0, a)) == False:
        break
    a = list(map(lambda x:x//2,a))
    cnt +=1
print (cnt)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

while True:
  flag = 0
  for i in range(N):
    if M(N) % 2 == 1:
      flag = 1
      break
    else:
      M(N) = M(N) / 2
  if flag == 1:
    print(cnt)
  else:
    cnt += 1

Submission status: Runtime Error

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

cnt =0

while True:
    if [i for i in A if i%2 == 1]:
        break
    A = [i/2 for i in A if i%2 ==0]
    cnt += 1
    
prnt(cnt)

Submission status: Runtime Error

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

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



resolve()

Submission status: Runtime Error

Solution code:
# import bisect
# import copy
# import fractions
# import math
#import numpy as np
# from collections import Counter, deque
# from itertools import accumulate,permutations, combinations,combinations_with_replacement,product

def resolve():
    n=int(input())
    A=np.array(list(map(int,input().split())))

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



resolve()

Submission status: Runtime Error

Solution code:
N = input()
hoge = map(int,input().split())
fuga = [bin(i) for i in hoge]
count = 10000000
for i in fuga:
  tmp = i[::-1]
    for j in range(len(i)):
      if tmp[j] == '1'  and count > j:
        count = j
        break
print(count)

Submission status: Runtime Error

Solution code:
N = input()
hoge = map(int,input().split())
fuga = [bin(i) for i in hoge]
count = 10000000
for i in fuga:
   	tmp = i[::-1]
    for j in range(len(i)):
        if tmp[j] == '1'  and count > j:
            count = j
            break
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:
  ans = min(ans,len(bin(i) - bin(i).rfind("1") - 1)
print(round(ans))

Submission status: Runtime Error

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


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

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

Submission status: Runtime Error

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


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

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
li = map(int, input().split())
number = 0
even_or_odd = 1
def check_number(list):
  for i in list:
    if i % 2 == 0:
      continue
    else:
      even_or_odd *= 0
      
def cut_in_two(list):
  for i in list:
    i /= 2

while True:
  if even_or_odd == 1:
    check_number(li)
    cut_in_two(li)
    number += 1
  else:
    print(number)
    break

Submission status: Runtime Error

Solution code:
N = int(input())
A = [int(i) for i in input().split()]
for i in input().split():
  if A[i] % 2 == 0:
    A[i] /= 2
  else:
    print(int(A[i]))

Submission status: Runtime Error

Solution code:
s = map(int(input().split()))
n = 0
i = 0
cout = 0
for i in s:
  if s[i] % 2 == 0:
    cout += 1
  else:
    cout += 0
print(cout)

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
s = map(int,input().split())
c = 0
for i in range(len(s)):
    while s[0] % 2 == 0:
        s[i] = s[i]/2
        c = c + 1
return c

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
import numpy as np

n = int(input())
a = [int(x) for x in input().split()]

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

Submission status: Runtime Error

Solution code:
import numpy as np

n = int(input())
a = [int(input()) for _ in range(n)]

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
n = int(input())
s = list(map(int,input().split()))
count = -1
error = 0
while(error == 0):
  	count = count + 1
    for i in range(len(s)):
        if(s[i]%2 != 0):
            error = 1
            break
print(count)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
n = int(input())
max_cnt = 0
num_list = [] 
for i in range(n):
  num_list.append(int(input()))
for num in num_list:
  num_cnt = 0
  while True:
    if num % 2 == 1:
      if num_cnt > max_cnt: max_cnt = num_cnt
      break
    else:
      num = num / 2
      num_cnt += 1
print(max_cnt)

Submission status: Runtime Error

Solution code:
n = int(input())
max_cnt = 0
num_list = [] 
for i in range(n):
  num_list.append(int(input()))

for num in num_list:
  num_cnt = 0
  while True:
    if num % 2 == 1:
      if num_cnt > max_cnt: max_cnt = num_cnt
      break
    else:
      num = num / 2
      num_cnt += 1
print(max_cnt)

Submission status: Runtime Error

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

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

Submission status: Runtime Error

Solution code:
a=int(input())
N=list(map(int,input.split())
m=0
       
def check(data):
       for i in range (a):
          if not N[i]%2==0:
             return False
             break
       return True
       
while check(N):
          for j in range(a):
             N[j]=N[j]/2
          m+=1
       
print (m)

Submission status: Runtime Error

Solution code:
from math import gcd
from functools import reduce


def main():
    n = int(input())
    numbers_gcd = reduce(gcd, list(map(int, input().split())))
    answer = 0
    while numbers_gcd > 0:
        if numbers_gcd % 2:
            break
        else:
            numbers_gcd //= 2
            answer += 1
    print(answer)


if __name__ == '__main__':
    main()

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
n = int(input())
a = list(map(int, input().split()))
l = []
for i in a:
    count = 0
    for j in range(1, 30):
        if i%(2**j) == 0:
            count += 1
        else:
            l.append(count)
            break
print(min(l))

Submission status: Runtime Error

Solution code:
n = int(input())
a = list(map(int, input().split()))
l = []
for i in a:
    count = 0
    for j in range(1, 20):
        if i%(2**j) == 0:
            count += 1
        else:
            l.append(count)
            break
print(min(l))

Submission status: Runtime Error

Solution code:
n = int(input())
a = list(map(int, input().split()))
l = []
for i in a:
    count = 0
    for j in range(1, 11):
        if i%(2**j) == 0:
            count += 1
        else:
            l.append(count)
            break
print(min(l))

Submission status: Runtime Error

Solution code:
n = int(input())
a = list(map(int, input().split()))
l = []
for i in a:
    count = 0
    for j in range(1, 10):
        if i%(2**j) == 0:
            count += 1
        else:
            l.append(count)
print(min(l))

Submission status: Runtime Error

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

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

print(count)

Submission status: Runtime Error

Solution code:
a = input()
b = input()
count = 0
numbers = list(map(int, b.split()))
def calicurate():
  for n in numbers:
    if n%2 ==0:
      n = n/2
    else:
      break
for i in calicurate():
  numbers.calicurate(i)
  count += 1
print(count)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
n = int(input())
list = [int(input()) for h in range(n) ]
s = 0
while True:
    for i in range(n):
        if list[i] % 2 == 1:
            break
    for j in range(n):
        list[j] = list[j] / 2
    s = s + 1
print(s)

Submission status: Runtime Error

Solution code:
n = int(input())
list = [int(input()) for num in range(n) ]
m = min(list)
a = 0
while True:
    m = m / 2
    if m <= 1:
        break
    a = a + 1
print(a)

Submission status: Runtime Error

Solution code:
n = int(input())
list = [int(input()) for 0 in range(n-1) ]
m = min(list)
a = 0
while True:
    m = m / 2
    if m <= 1:
        break
    a = a + 1
print(a)

Submission status: Runtime Error

Solution code:
n = list(map(int, input().split()))
a = input().split()
b = 0
c = 0
while True:
    b = min(a) / 2
    if b <= 1:
        break
    c = c + 1
print(c)

Submission status: Runtime Error

Solution code:
n = int(input())
a = input().split()
b = 0
c = 0
while True:
    b = min(a) / 2
    if b <= 1:
        break
    c = c + 1
print()

Submission status: Runtime Error

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

Submission status: Runtime Error

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


temp_list = []
while can_devide == True:
  for num in nums:
    if num % 2 == 1:
      print(num_dvd)
      can_devide == False
    else:
      temp_list.append(num // 2)
  num_dvd += 1

Submission status: Runtime Error

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

int cnt=0

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

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

Submission status: Runtime Error

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

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

Submission status: Runtime Error

Solution code:
import numpy as np
n = int(input())
val = map(int, input().split())
count = 0
val_list = np.array(list(map(int, val.split())))

while True:
    # 偶数の数算出
    even_cnt = len(list(filter(lambda x:x % 2 == 0, val_list)))
    
    # 配列の値の偶数判定
    if n == even_cnt:
        # 配列の割り算
        val_list = val_list/2
        # 上記繰り返しの回数保存
        count += 1
    else:
        break
print(count)

Submission status: Runtime Error

Solution code:
n = int(input())
val = map(int, input().split())
count = 0
val_list = np.array(list(map(int, val.split())))

while True:
    # 偶数の数算出
    even_cnt = len(list(filter(lambda x:x % 2 == 0, val_list)))
    
    # 配列の値の偶数判定
    if n == even_cnt:
        # 配列の割り算
        val_list = val_list/2
        # 上記繰り返しの回数保存
        count += 1
    else:
        break
print(count)

Submission status: Runtime Error

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

#整数値入力 1文字の入力
def input_one_number():
    return int(input())

#整数値龍力　複数の入力
def input_multiple_number():
    return map(int, input().split())

#整数値龍力　複数の入力(配列)
def input_multiple_number_as_list():
    return list(map(int, input().split()))

#2次元配列入力
def input_map():
    return [list(map(int,list(input()))) for i in range(h)]

#リスト出力
def print_list(list):
    print(*list)
    return

#2次元配列出力
def print_map(maplist):
    for i in maplist:print(*i, sep='')
    return

#素数生成
def generate_primenums():
    n = 100
    primes = set(range(2, n+1))
    for i in range(2, int(n**0.5+1)):
        primes.difference_update(range(i*2, n+1, i))
    primes=list(primes)
    return primes

def memo():
    a=[0]*5
    b=a  #良くない配列のコピー
    b2=a[:]  #1次元のときはコピーはこれで良い
    a[1]=3
    print('b:{}, b2:{}'.format(b,b2))  #b:[0, 3, 0, 0, 0], b2:[0, 0, 0, 0, 0]
    
    import copy
    a= [[0]*3 for i in range(5)] #2次元配列はこう準備、[[0]*3]*5だとだめ
    b=copy.deepcopy(a)  #2次元配列はこうコピーする
    
    #内包表記奇数のみ
    odd=[i for i in range(100) if i%2==1] #[1, 3, 5, 7, 9, 11, 13, 15, 17, 19]
    
    #二部探索
    import bisect
    a = [1, 2, 3, 5, 6, 7, 8, 9]
    b=bisect.bisect_left(a, 8)
    
    #combinations、組み合わせ、順列
    from itertools import permutations, combinations,combinations_with_replacement,product
    a=['a','b','C']
    print(list(permutations(a)))
    print(list(combinations(a,2)))
    print(list(combinations_with_replacement(a,3)))


#階乗
def kaijo(n):
    import math
    return math.factorial(n)

#選び方（コンビネーション nCr）
def num_combination(n,r):
    import math
    return math.factorial(n) // math.factorial(n - r)


#最大公約数、最小公倍数
def calc_gcd_lcm(a,b):
    import fractions
    GCD=fractions.gcd(a,b)
    lcm=a*b//gcd
    return gcd,lcm

#複数の最大公約数
def calc_gcd_list(l):
    import numpy as np
    return np.gcd.reduce(l)

N = input_one_number()
lst_A = input_multiple_number_as_list()

a = calc_gcd_list(lst_A)

cnt = 0
while a > 0:
    if a%2 == 0:
        cnt += 1
    a //= 2
print(cnt)

Submission status: Runtime Error

Solution code:
    n = input()
    a = list(map(int, input().split()))
    even = True
    count = 0
    while even:
        for ai in range(len(a)):
            if a[ai] % 2 != 0:
                even = False
                break

        if even:
            a = list(map(lambda num: num / 2, a))
            count += 1
        else:
            break
    print(count)

Submission status: Runtime Error

Solution code:
N = int(input())
list = list(int(input()))
count=0
while all(i%2 == 0 for i in list):
    count+=1
    list=[j/2 for j in list]
print(count)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
a, b, c, x = map(int, [input() for i in range(4)])
ans = 0
for i in range(a+1):
    for j in range(b+1):
        for k in range(c+1):
            if i * 500 + j * 100 + k * 50 == x:
                ans += 1
print(ans)

Submission status: Runtime Error

Solution code:

def factorization(n):
    arr = []
    temp = n
    for i in range(2,3):
        if temp%i==0:
            cnt=0
            while temp%i==0:
                cnt+=1
                temp //= i
            arr.append(cnt)


    return arr

n=int(input())
num=list(map(factorization,list(map(int,input().split()))))
print(min(num)[0])

Submission status: Runtime Error

Solution code:
# 数値の入力とリスト化
N = int(input())
s = input()
l = [int(N) for N in s]
print(l[1])

# 割り算できる回数
x = 0
for n in N
    if l[n] % 2 == 0:
        x == x + 1

Submission status: Runtime Error

Solution code:
import sys

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
import math

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

ans = float("inf")

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

Submission status: Runtime Error

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

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

print(ans)

Submission status: Runtime Error

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

print(min(m[i].rfind(1)-1 for i in range(1,n+1)))

Submission status: Runtime Error

Solution code:
n=input()

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

b=map(bin,a)

c=map(rfind('1')-1,c)

print(min(c))

Submission status: Runtime Error

Solution code:
n=input()

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

b=map(rfind('1')-1,a)

print(min(b))

Submission status: Runtime Error

Solution code:
n=input()

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

b=list(map(rfind('1')-1,a))

print(min(b))

Submission status: Runtime Error

Solution code:
#include <bits/stdc++.h>

#define all(x) (x).begin(),(x).end()
#define init() \
  ios::sync_with_stdio(false); \
  cin.tie(0)

using namespace std;

using ll = long long;
using ull = unsigned long long;

template<typename M, typename N>
constexpr common_type_t<M, N> gcd(M a, N b) {
  return a == 0 ? b
    : b == 0 ? a
    : gcd(b, a % b);
}

template <typename M, typename N>
constexpr common_type_t<M, N> lcm(M a, N b) {
  return a * b / gcd(a, b);
}

int main() {
  init();

  int n;
  cin >> n;
  vector<int> a(n);
  for(int i=0;i<n;i++){
    cin >> a[i];
  }
  
  int min = 9999999;
  for(int k:a){
    int r = 0;
    while(k != 0 && (k & 1) == 0){
      k >>= 1;
      if (r == min){
        break;
      }
      r++;
    }
    min = r;
    if(min==0){break;}
  }
  cout << min << '\n';

  return 0;
}

Submission status: Runtime Error

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

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

Submission status: Runtime Error

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

while flag:
  fot i in range(N):
    if A[i] % 2 != 0:
      flag = False
      break
  if !flag:
    print(count)
  count += 1
  A[i] = A[i] / 2

Submission status: Runtime Error

Solution code:
N = int(input())
res = 1000000000000
for i in range(N):
    count = 0
    x = int(input())
    while x%2==0:
        x /= 2
        count += 1
    if res > count: res = count
print(res)

Submission status: Runtime Error

Solution code:
# https://atcoder.jp/contests/abc081/tasks/abc081_b
import math

def div_list(list_num):
    _div_list = []
    can_iter = True
    for k in range(len(list_num)):
        if math.isclose(list_num[k]%2, 0) == False:
            can_iter = False
        _div_list.append(list_num[k] / 2)
    return can_iter, _div_list


n_input = int(input())
list_number = input().split()
list_number = list(map(float, list_number))

n_iter = 0
can_iter = True

while can_iter == True:
    can_iter, list_number = div_list(list_number)
    if can_iter == True:
        n_iter += 1

print(n_iter)

Submission status: Runtime Error

Solution code:
htN = int(input())
A = map(int, input().split())
C=0
while True:
  for i in A:
    if A[i]%2 != 0:
        print(C)
        exit()
    A[i]/=2
    C+=1

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
#include <iostream>
#include <string>
#include <vector>
#include <deque>
#include <queue>
#include <algorithm>
#include <set>
#include <map>
#include <bitset>
#include <cmath>
#include <functional>
#define vv(a, b, c, d) vector<vector<d> >(a, vector<d>(b, c))
#define vvi vector<vector<int> >
#define vvl vector<vector<ll> >
#define vll vector<ll>
#define rep(c, a, b) for(ll c=a;c<b;c++)
#define re(c, b) for(ll c=0;c<b;c++)
#define all(obj) (obj).begin(), (obj).end()
typedef long long int ll;
typedef long double ld;
using namespace std;

int main(int argc, char const *argv[]) {
  ll n;std::cin >> n;
  bitset<70> s;
  ll t;
  re(i, n){
    std::cin >> t;
    s|=t;
  }
  for(int i=0;i<70;i++){
    if(s[i]){
      std::cout << i << '\n';
      return 0;
    }
  }
  return 0;
}

Submission status: Runtime Error

Solution code:
t=int(input())

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

count=0
while true:
  if li[0:t]%2==0:
  	for i in range(t):
    	li[i]=li[i]/2
    count+=1
	continue
  break
print(count)

Submission status: Runtime Error

Solution code:
t=int(input())

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

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
n = int(input())
x = 0
for i in range(n) :
  list[] = int(input())

while True :
    for j in range(n):
        if list[j] % 2 == 1:
            break
    
    for k in range(n):
        list[k] = list[k] / 2

    x = x + 1
   
print(x)

Submission status: Runtime Error

Solution code:
n = int(input())
s=list(str,input())
count = 0
for s in range(10) 
    for i in range(n):
        if type(s[i]/2) ==True :
            s[i]=s[i]/2
            i = i+1
        count +=1
        elif type(s[i]/2) ==False:
        break
break
print(count)

Submission status: Runtime Error

Solution code:
def check(st,count):
    flag = False
    new_list = []
    for i in st:
        if i % 2 == 0:
            new_list.append(i)
        else:
            flag = True
            break
    if flag:
        print(count)
        return
    else:
      count += 1
      check(new_list, count)
      
n = int(input())
st = list(map(int, input().split()))
count = 0
check(st, count)

Submission status: Runtime Error

Solution code:
n = int(input())
st = map(int, input().split())
flag = True
count = 0
check(st, count)
def check(st,count):
    new_list = []
	for i in len(st):
      if i % 2 == 0:
        new_list.append(i)
      else:
        flag = True
        break
    if flag:
      print(count)
      return
    else:
      count += 1
      check(new_list, count)