ZhenlongDai/ACPR huggingface dataset:
Problem: p03494
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
_ = input()
num_list = list(map(int, input().split()))

res = 0

for num in num_list:
  count = 0
  
  while(num % 2  == 0):
    num /= 2
    count += 1
  
  if count < res:
    res = count
    
print(res)


Failing test case input:
6
382253568 723152896 37802240 379425024 404894720 471526144

Expected output:
8

Actual output:
0


Fixed submission (verdict: Accepted):
_ = input()
num_list = list(map(int, input().split()))

res = 1000000

for num in num_list:
  count = 0
  
  while(num % 2  == 0):
    num /= 2
    count += 1
  
  if count < res:
    res = count
    
print(res)

Problem: p03494
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
n = int(input())
a = list(map(int, input().split()))

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

print(count)

Failing test case input:
6
348324507 723152896 32183854 379425024 590201381 471526144

Expected output:
0


Actual output:
6


Fixed submission (verdict: Accepted):
n = int(input())
a = list(map(int, input().split()))

count = 0
flag = 0

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


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

print(count)

Problem: p03494
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
n = int(input())
num = list(map(int, input().split()))
count = 0
for i in range(n):
    if num[i] % 2 == 0:
        num[i] /= 2
    else:
        break
    if i == n - 1:
        count += 1
print(count)

Failing test case input:
3
8 12 40

Expected output:
2

Actual output:
1


Fixed submission (verdict: Accepted):
n = int(input())
num = list(map(int, input().split()))
count = 0
while True:
    exist_odd = "false"
    for i in range(n):
        if num[i] % 2 != 0:
            exist_odd = "True"
    if exist_odd == "True":
        break
    for i in range(n):
        num[i] /= 2
    count += 1
print(count)

Problem: p03494
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
import math


def half(xs):
    for x in xs:
        if x % 2 != 0:
            return xs
    for i in range(len(xs)):
        xs[i] /= 2
    return half(xs)


def main():
    ls = [int(num) for num in input().split()]
    a = ls[0]
    res = half(ls)
    b = ls[0]
    if b != 0:
        print("{:.0f}".format(math.log2(a / b)))
    else:
        print("0")


if __name__ == "__main__":
    main()


Failing test case input:
4
14 6 11 19

Expected output:
0


Actual output:
2


Fixed submission (verdict: Accepted):
def half(xs):
    count = 0
    while True:
        for i in range(len(xs)):
            if xs[i] % 2 != 0 or xs[i] == 0:
                return count
            xs[i] /= 2
        else:
            count += 1
    return count


def main():
    _num = input()
    xs = [int(i) for i in input().split()]
    res = half(xs)
    print(res)


if __name__ == "__main__":
    main()
Problem: p03494
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
def answer(in0, in1):

    N = int(in0)
    A = [int(a) for a in in1.split()]

    print(N)
    print(A)
    cnt = 0

    while (True):
        for i in range(N):
            a = A[i]
            if a % 2 != 0:
                print(cnt)
                return
            A[i] = int(a / 2)
        cnt += 1


answer(input(), input())


Failing test case input:
6
71148002 1055849701 81412222 34292530 236966 734273188

Expected output:
0


Actual output:
6
[71148002, 1055849701, 81412222, 34292530, 236966, 734273188]
0


Fixed submission (verdict: Accepted):
def answer(in0, in1):

    N = int(in0)
    A = [int(a) for a in in1.split()]

    cnt = 0

    while (True):
        for i in range(N):
            a = A[i]
            if a % 2 != 0:
                print(cnt)
                return
            A[i] = int(a / 2)
        cnt += 1


answer(input(), input())

Problem: p03494
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
n = int(input())
a = list(map(int,input().split()))
m = 0
while True:
	if (a[0] % 2 == 0) and (a[1] % 2 == 0) and (a[2] % 2 == 0):
		m += 1
		for i in range(len(a)):
			a[i] /= 2
	else:
		break
print(m)

Failing test case input:
6
382253568 723152896 37802240 379425024 590201381 471526144

Expected output:
0


Actual output:
8


Fixed submission (verdict: Accepted):
n = int(input())
a = list(map(int,input().split()))
m = 0
while True:
	l = 0
	for j in range(n):
		l += a[j] % 2
	if l == 0:
		m += 1
		for i in range(n):
			a[i] /= 2
	else:
		break
print(m)

Problem: p03494
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
n = int(input())
x = input().split()
count = 0
flg = 0
while True:
  for i in range(0, n):
    if int(x[i]) % 2 != 0:
      flg = 1
  count += 1
  if flg == 0:
    x.insert(i, int(x[i]) /2)
  else:
    break
print(count)

Failing test case input:
6
71148002 1320359906 59907007 21985869 236966 233525638

Expected output:
0


Actual output:
1


Fixed submission (verdict: Accepted):
n = int(input())
x = input().split()
count = 0
flg = 0
while flg == 0:
  for i in range(0, n):
    if int(x[i]) % 2 != 0:
      flg = 1
  
  if flg == 0:
    count += 1
    for i in range(0, n):
      x[i] = int(x[i]) / 2
print(count)

Problem: p03494
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
n=int(input())
a=list(map(int,input().split()))
x=0
b=0
for i in range(n):
    b+=a[i]%2
while a[i]%2==0 :
    x += 1
    for i in range(n):
        a[i]/=2
        b+=a[i]%2
print(x)


Failing test case input:
6
586050932 1892549229 30334838 27068201 10685560 243833698

Expected output:
0


Actual output:
1


Fixed submission (verdict: Accepted):
n=int(input())
a=list(map(int,input().split()))
x=0
b=0
for i in range(n):
    b+=a[i]%2
while b==0 :
    x += 1
    for i in range(n):
        a[i]/=2
        b+=a[i]%2
print(x)
Problem: p03494
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
N = int(input())
A = list(map(int, input().split()))
c = 0
f = True
while(True):
  for i in range(N):
    if A[i]%2 == 1:
      f = False
  if f:
    for i in range(N):
      A[i] /= 2
      c += 1
  else:
    break
print(c)

Failing test case input:
3
8 12 40

Expected output:
2

Actual output:
6


Fixed submission (verdict: Accepted):
N = int(input())
A = list(map(int, input().split()))
c = 0
f = True
while(True):
  for i in range(N):
    if A[i]%2 == 1:
      f = False
  if f:
    for i in range(N):
      A[i] /= 2
    c += 1
  else:
    break
print(c)

Problem: p03494
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
num = int(input())
a = [int(e) for e in input().split()]
cnt = 0   
while 1:
  cnt = 0
  for i in range(num):
    if a[i]%2 != 0:
      cnt += 1
  if cnt != 0:
    break
  for i in range(num):
    a[i] = int(a[i]/2)
  
print(a)

Failing test case input:
6
586050932 1892549229 59907007 27068201 19465326 243833698

Expected output:
0


Actual output:
[586050932, 1892549229, 59907007, 27068201, 19465326, 243833698]


Fixed submission (verdict: Accepted):
num = int(input())
a = [int(e) for e in input().split()]
cnt = 0   
cnt2 = 0
while 1:
  cnt = 0
  for i in range(num):
    if a[i]%2 != 0:
      cnt += 1
  if cnt != 0:
    break
  for i in range(num):
    a[i] = int(a[i]/2)
  cnt2 += 1
  
print(cnt2)

Problem: p03494
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
a = int(input())
b = list(map(int, input().split()))

cnt = 0
endflag = False

while(True):
  for i in range(0,a):
    if ((b[i] %2 ) == 0):
      b[i] = b[i] / 2
    else:
      endflag = True
      break
  cnt = cnt + 1
  if (endflag):
    break

print(cnt)


Failing test case input:
6
586050932 1892549229 30334838 27068201 10685560 243833698

Expected output:
0


Actual output:
1


Fixed submission (verdict: Accepted):
a = int(input())
b = list(map(int, input().split()))

cnt = 0
endflag = False

while(True):
  for i in range(0,a):
    if ((b[i] %2 ) == 0):
      b[i] = b[i] / 2
    else:
      endflag = True
      break
  if (endflag):
    break
  cnt = cnt + 1

print(cnt)

Problem: p03494
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
n = int(input())
nums = list(map(int,input().split()))
ans = 0
while sum(nums)%2 == 0:
    for i in range(n):
        nums[i]=nums[i]/2
    ans +=1
print(ans)

Failing test case input:
3
4 23 31

Expected output:
0


Actual output:
1


Fixed submission (verdict: Accepted):
n = int(input())
nums = list(map(int,input().split()))
ans = 0
while True:
    for i in range(n):
        if nums[i] % 2 ==0:
            nums[i]=nums[i]/2
        else:
            print(ans)
            exit()
    ans +=1
Problem: p03494
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
n=int(input())
data=list(map(int, input().split()))
for i in range( max(data)):
  data = list(filter(lambda x: x%2==0, map( lambda x: int(x / 2),  data)))
  if len(data) < n:
    print(i+1)
    break

Failing test case input:
4
5 6 24 10

Expected output:
0


Actual output:
1


Fixed submission (verdict: Accepted):
n=int(input())
data=list(map(int, input().split()))
for i in range( max(data)):
  even_data = list(filter(lambda x: x%2==0, data))
  if len(even_data) < n:
    print(i)
    break
  data = list(map( lambda x: x / 2,  data))

Problem: p03494
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
n = int(input())
a = list(map(int, input().split()))
res = 0;
a = sum(a)
while a%2==0:
    a=a/2
    res+=1
print(res)

Failing test case input:
6
71148002 1800176736 24185535 5864889 174453 1171612875

Expected output:
0


Actual output:
1


Fixed submission (verdict: Accepted):
n = int(input())
a = list(map(int, input().split()))
res = 0
while all(i % 2 == 0 for i in a):
    a = [i/2 for i in a]
    res += 1
print(res)

Problem: p03494
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
N = int(input())
A = list(map(int,input().split()))

cnt=0

for i in range(N):
    
    if all(A) % 2 == 0:
        A = list(map(lambda x: x/2,A))
        
    else:
        break
    cnt += 1
    
print(cnt)

Failing test case input:
3
8 12 40

Expected output:
2

Actual output:
0


Fixed submission (verdict: Accepted):
N = int(input())
A = list(map(int,input().split()))

cnt = 0

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

Problem: p03494
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
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()


Failing test case input:
6
382253568 723152896 32183854 379425024 590201381 471526144

Expected output:
0


Actual output:
8


Fixed submission (verdict: Accepted):
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()
    print(num_2n_list[0])


if __name__ == '__main__':
    main()
Problem: p03494
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
N = int(input())
b = list(map(int, input().split()))
cnt = 0
for i in b:
    i % 2 ==0
    b = [i/2 for i in b]
    cnt += 1
    if i % 2 != 0:
        break
print(cnt-1)

Failing test case input:
6
71148002 1055849701 81412222 21985869 236966 400136429

Expected output:
0


Actual output:
1


Fixed submission (verdict: Accepted):
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)

Problem: p03494
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
s=map(int,input().split())
s=map(int,input().split())
ans = []
for i in s:
    tmp=i
    count=0
    while(1):
        if tmp%2==0:
            tmp=tmp/2
            count=count+1
        else:
            break
    ans.append(count)
min(ans)

Failing test case input:
6
382253568 723152896 32183854 379425024 590201381 471526144

Expected output:
0


Actual output:

Fixed submission (verdict: Accepted):
s=map(int,input().split())
s=map(int,input().split())
ans = []
for i in s:
    tmp=i
    count=0
    while(1):
        if tmp%2==0:
            tmp=tmp/2
            count=count+1
        else:
            break
    ans.append(count)
print(min(ans))

Problem: p03494
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
n = int(input())
array = map(int, input().split())

ans = 999999
for a in array:
  cnt = 0
  while(a % 2 == 1):
    cnt += 1
    a = a / 2
  ans = min(ans, cnt)
print(ans)    

Failing test case input:
6
382253568 723152896 37802240 379425024 404894720 471526144

Expected output:
8

Actual output:
0


Fixed submission (verdict: Accepted):
n = int(input())
array = map(int, input().split())

ans = 999999
for a in array:
  cnt = 0
  while(a % 2 == 0):
    cnt += 1
    a = a / 2
  ans = min(ans, cnt)
print(ans)

Problem: p03494
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
n = int(input())
a = list(map(int, input().split()))
count = 0
flg = True
while(flg):
    for i in range(n):
        if a[i]%2 != 0:
            flg = False
            break
        else:
            a[i] = a[i]/2
            count += 1
print(count)

Failing test case input:
6
71148002 1320359906 59907007 21985869 236966 136055793

Expected output:
0


Actual output:
2


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

Problem: p03494
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
N=int(input())
x=list(map(int,input().split()))

for i in range(N):
  count=0
  while x[i]%2==0:
    x[i]/=2
    count+=1
    
print(count)

Failing test case input:
6
71148002 1055849701 81412222 34292530 236966 734273188

Expected output:
0


Actual output:
2


Fixed submission (verdict: Accepted):
N=int(input())
x=list(map(int,input().split()))

count=[0]*N

for i in range(N):
  while x[i]%2==0:
    x[i]/=2
    count[i]+=1
    
print(min(count))
Problem: p03494
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
N = input()
num = list(map(int,input().split()))
count = 0

while not all([n%2 for n in num]):
    num = [n/2 for n in num]
    count += 1
print(count)

Failing test case input:
4
13 6 43 24

Expected output:
0


Actual output:
3


Fixed submission (verdict: Accepted):
a = input()
num = list(map(int,input().split()))
count = 0

while not any([n%2 for n in num]):
    num = [n/2 for n in num]
    count += 1
print(count)

Problem: p03494
Buggy submission (PyPy3 (7.3.0), verdict: Wrong Answer):
nn = int(input())
dd = list(map(int,input().split()))
nof_op = 0
finish = 1
while True:
    for ind in range(nn):
        if (dd[ind] % 2) == 1:
            finish = 1
        dd[ind] = dd[ind] / 2
    if finish == 1:
        break
    else:
        nof_op += 1
print(nof_op)

Failing test case input:
3
16 36 16

Expected output:
2


Actual output:
0


Fixed submission (verdict: Accepted):
nn = int(input())
dd = list(map(int,input().split()))
nof_op = 0
finish = 0
while True:
    for ind in range(nn):
        if (dd[ind] % 2) == 1:
            finish = 1
            break
        else:
            dd[ind] = dd[ind] / 2
    if finish == 1:
        break
    else:
        nof_op += 1
print(nof_op)

Problem: p03494
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
_ = 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)

Failing test case input:
3
2 36 114

Expected output:
1


Actual output:
3


Fixed submission (verdict: Accepted):
_ = input()
num_list = input().split(" ")
num_list = list(map(lambda x:int(x), num_list))
shift_counter = 0

def checker(num_list):
  for n in num_list:
    if n % 2 != 0:
      return True
  return False

while(True):
  if checker(num_list):
    print(shift_counter)
    break
  else:
    num_list = [int(n/2) for n in num_list]
    shift_counter += 1

Problem: p03494
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
n = int(input())
li = list(map(int,input().split()))
split_cnt = 0
p = 0
while p == 0:
    for i in range(len(li)):
        if li[i] % 2 == 1:
            p = 1
            break
        else:
            li[i] = li[i] / 2
    split_cnt += 1
print(split_cnt)

Failing test case input:
4
14 6 15 19

Expected output:
0


Actual output:
1


Fixed submission (verdict: Accepted):
n = int(input())
li = list(map(int,input().split()))
split_cnt = 0
p = 0
while p == 0:
    for i in range(len(li)):
        if li[i] % 2 == 1:
            p = 1
            break
        else:
            li[i] = li[i] / 2
    split_cnt += 1
print(split_cnt - 1)
Problem: p03494
Buggy submission (PyPy3 (7.3.0), verdict: Wrong Answer):

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

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

print(count)

Failing test case input:
3
9 25 16

Expected output:
0


Actual output:
[9, 25, 16]
0


Fixed submission (verdict: Accepted):

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

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

print(count)

Problem: p03494
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
n = input()
l = list(map(int, input().split()))

cnt = 0
flg = True
while flg:
  for i in range(len(l)):
    if l[i] % 2:
      l[i] /= 2
    else:
      flg = False
      break
  if flg:
    cnt += 1

print(cnt)

Failing test case input:
3
8 12 40

Expected output:
2

Actual output:
0


Fixed submission (verdict: Accepted):
n = input()
l = list(map(int, input().split()))

cnt = 0
flg = True
while flg:
  for i in range(len(l)):
    if l[i] % 2 == 0:
      l[i] /= 2
    else:
      flg = False
      break
  if flg:
    cnt += 1

print(cnt)

Problem: p03494
Buggy submission (Python (3.4.3), verdict: Wrong Answer):

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

Failing test case input:
3
9 36 16

Expected output:
0


Actual output:
2


Fixed submission (verdict: Accepted):
N=int(input())
A=list(map(int,input().split()))
flag=False
ans=0
while True:
    for i,j in enumerate(A):
        if j%2!=0:
            print(ans)
            flag=True
            break
        else:
            A[i]=j/2
    ans+=1 
    if flag:
        break

Problem: p03494
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
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)

Failing test case input:
3
4 13 25

Expected output:
0


Actual output:
1


Fixed submission (verdict: Accepted):
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:
        a = [i/2 for i in a]
        hantei = [i%2 for i in a]
        count+=1
print(count)
Problem: p03494
Buggy submission (Python (3.4.3), verdict: Wrong Answer):






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)


Failing test case input:
3
13 36 16

Expected output:
0


Actual output:
1


Fixed submission (verdict: Accepted):






def count_operation(numbers):
    is_even = True
    count = 0

    while is_even is True:
        elements = divided_by(2 ** (count + 1), numbers)

        if elements.count(0) == number_count:
            count += 1
        else:
            is_even = False
    return count


def divided_by(number, numbers):
    return [element % number for element in numbers]


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

    result = count_operation(numbers)
    print(result)

Problem: p03494
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
N=int(input())
L=list(map(int,input().split()))
counter=0
t=0
for i in range(N):
  if L[i]%2==0:
    t+=1
if t==N:
  for i in range(N):
    L[i]=int(L[i]/2)
  counter+=1
print(counter)

Failing test case input:
6
382253568 723152896 37802240 379425024 404894720 471526144

Expected output:
8

Actual output:
1


Fixed submission (verdict: Accepted):
N=int(input())
L=list(map(int,input().split()))
counter=0
t=0
for p in range (30):
  t=0
  for i in range(N):
    if L[i]%2==0:
      t+=1
  if t==N:
    for i in range(N):
      L[i]=int(L[i]/2)
    counter+=1
print(counter)

Problem: p03494
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
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)
      

Failing test case input:
6
586050932 1154626501 30334838 27068201 10685560 243833698

Expected output:
0


Actual output:
1


Fixed submission (verdict: Accepted):
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)
Problem: p03494
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
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)

Failing test case input:
4
12 6 17 9

Expected output:
0


Actual output:
1


Fixed submission (verdict: Accepted):
N = int(input())
P = list(map(int,input().split()))
S = []
a = 0
p = 0
s = 0
while True:
    
    for i in range(N):
        if P[i] % 2 == 1:
            s = 1
        else:
            P[i] = P[i] / 2
    if s == 1:
        break
    a += 1

print(a)

Problem: p03494
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
n = int(input())
A = list(map(int, input().split()))

print(A)

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

print(count)


Failing test case input:
6
382253568 723152896 37802240 379425024 404894720 471526144

Expected output:
8

Actual output:
[382253568, 723152896, 37802240, 379425024, 404894720, 471526144]
8


Fixed submission (verdict: Accepted):
n = int(input())
A = list(map(int, input().split()))

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

print(count)

Problem: p03494
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
input()
A = list(map(int, input().split()))
count = 0

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

Failing test case input:
4
10 6 24 10

Expected output:
1


Actual output:
0


Fixed submission (verdict: Accepted):
input()
A = list(map(int, input().split()))
count = 0

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

Problem: p03494
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
N = int(input())
A = list(map(int, input().split()))
print(A)
count = 0
while all(a % 2 == 0 for a in A):
    A = [a/2 for a in A]
    count +=1
    print(A)
print(count)


Failing test case input:
6
71148002 1800176736 117468765 5864889 174453 1171612875

Expected output:
0


Actual output:
[71148002, 1800176736, 117468765, 5864889, 174453, 1171612875]
0


Fixed submission (verdict: Accepted):
input()
A = list(map(int, input().split()))
count = 0
while all(a % 2 == 0 for a in A):
    A = [a/2 for a in A]
    count += 1
print(count)

Problem: p03494
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
n = int(input())
A = list(map(int, input().split()))




cnt = 0

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

Failing test case input:
3
4 7 31

Expected output:
0


Actual output:
1


Fixed submission (verdict: Accepted):
n = int(input())
A = list(map(int, input().split()))




cnt = 0

flag=True
while flag:
    for a in A:
        if a % 2 == 0:
            continue
        else:
            flag=False
            break 
    if not flag: 
        break
    A = [a/2 for a in A]
    cnt = cnt + 1
print(cnt)
Problem: p03494
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
N = input()
numbers = list(map(int, input().split()))
cnt = 0
while sum([True if n%2==0 else False for n in numbers])>0:
  numbers = [n/2 for n in numbers]
  cnt += 1
print(cnt)

Failing test case input:
3
4 13 25

Expected output:
0


Actual output:
2


Fixed submission (verdict: Accepted):
N = input()
numbers = list(map(int, input().split()))
cnt = 0
while sum([True if n%2==1 else False for n in numbers])==0:
  numbers = [n/2 for n in numbers]
  cnt += 1
print(cnt)

Problem: p03494
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
n = int(input())
a_list = list(map(int, input().split()))

n_divided = 0


if 1 in a_list:
    print("0")
else: 
    while 1:
        a_list = [x/2 for x in a_list]
        n_divided += 1
        for idx in range(len(a_list)):
            if a_list[idx] % 2 != 0:
                print(n_divided)
                exit()

Failing test case input:
6
71148002 1800176736 117468765 5864889 179710 734273188

Expected output:
0


Actual output:
1


Fixed submission (verdict: Accepted):
n = int(input())
a_list = list(map(int, input().split()))

n_divided = 0

def list_contains_odd(list):
    r = False
    for idx in range(len(list)):
            if list[idx] % 2 != 0:
                r = True
    return r


if list_contains_odd(a_list):
    print("0")
else: 
    while 1:
        a_list = [x/2 for x in a_list]
        n_divided += 1
        if list_contains_odd(a_list):
            print(n_divided)
            exit()

Problem: p03494
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
n = int(input())
a = list(map(int, input().split()))
cnt = 0
flag = True

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

Failing test case input:
4
10 6 24 10

Expected output:
1


Actual output:

Fixed submission (verdict: Accepted):
n = int(input())
a = list(map(int, input().split()))
cnt = 0
flag = True

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

print(cnt)

Problem: p03494
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
N = int(input())
A = list(map(int, input().split()))
B = []
for a in A:
  i = 0
  while a % 2 ** i == 0:
    i += 1
    B.append(i - 1)
B.sort()
print(B[0])


Failing test case input:
3
8 12 40

Expected output:
2

Actual output:
0


Fixed submission (verdict: Accepted):
N = int(input())
A = list(map(int, input().split()))
B = []
for a in A:
  i = 0
  while a % 2 ** i == 0:
    i += 1
  B.append(i - 1)
B.sort()
print(B[0])
Problem: p03494
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
N = int(input()) 
nums = list(map(int, input().split()))
maxval = 0
for i in nums:
  cnt = 0
  while i % 2 == 0:
    cnt+=1
    i /= 2
  if maxval < cnt: maxval = cnt  
print(maxval)

Failing test case input:
6
71148002 1800176736 81412222 7499695 179710 734273188

Expected output:
0


Actual output:
5


Fixed submission (verdict: Accepted):
N = int(input()) 
nums = list(map(int, input().split()))
lst = []
for i in nums:
  cnt = 0
  while i % 2 == 0:
    cnt+=1
    i /= 2
  lst.append(cnt)
print(min(lst))

Problem: p03494
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
n=int(input())
a=list(map(int,input().split()))
d=[]
for c in range(n):
  b=0
  while a[c]%2==0:
    a[c]=int(a[c]/2)
    b+=1
  d.append(b)
print(max(d))


Failing test case input:
6
71148002 1800176736 57659801 5864889 174453 1171612875

Expected output:
0


Actual output:
5


Fixed submission (verdict: Accepted):
n=int(input())
a=list(map(int,input().split()))
d=[]
for c in range(n):
  b=0
  while a[c]%2==0:
    a[c]=int(a[c]
    b+=1
  d.append(b)
print(min(d))

Problem: p03494
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
n = int(input())
a = list(map(int, input().split()))
cnt = 0

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

Failing test case input:
3
7 7 52

Expected output:
0


Actual output:

Fixed submission (verdict: Accepted):
n = int(input())
a = list(map(int, input().split()))
cnt = 0

while True:
    if sum([a[i]%2 for i in range(n)]) == 0:
        a = [int(n/2) for n in a]
        cnt += 1
    else:
        break
print(cnt)

Problem: p03494
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
s = input()
num_list = list(map(int, input().split()))

flg_break = True

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

print(count)

Failing test case input:
6
105530884 1320359906 59907007 27068201 236966 136055793

Expected output:
0


Actual output:
1


Fixed submission (verdict: Accepted):
s = input()
num_list = list(map(int, input().split()))

flg_break = True

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

print(count)

Problem: p03494
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
input()
A = list(map(int, input().split()))

A.sort()
minval = A[0]
count = 0

while minval % 2 == 0:
  minval /= 2
  count += 1
  
print(count)

Failing test case input:
4
12 2 26 9

Expected output:
0


Actual output:
1


Fixed submission (verdict: Accepted):
input()
A = list(map(int, input().split()))

count = 0
while all(a % 2 == 0 for a in A):
  A = [a / 2 for a in A]
  count += 1
  
print(count)
Problem: p03494
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
N = int(input())
A = input().split()
A = [int(i) for i in A]

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




Failing test case input:
4
5 6 24 10

Expected output:
0


Actual output:
this is


Fixed submission (verdict: Accepted):
N = int(input())
A = input().split()
A = [int(i) for i in A]

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

Problem: p03494
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
n=input()
div=30
count=0
for i in input().split():
  while int(i)%2==0:
    i=int(i)/2
    count+=1
  if count<div:
    div=count
print(div)

Failing test case input:
6
71148002 1055849701 81412222 7499695 236966 734273188

Expected output:
0


Actual output:
1


Fixed submission (verdict: Accepted):
n=input()
div=30
count=0
for i in input().split():
  while int(i)%2==0:
    i=int(i)/2
    count+=1
  if count<div:
    div=count
  count=0
print(div)

Problem: p03494
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
n = int(input())
a = list(map(int, input().split()))

t = True
x = 0

while t == True:
  for i in a:
    if i%2 == 0:
      a = list(map(lambda x:x/2, a))
    else:
      t = False
  x += 1
      
print(x)
    


Failing test case input:
4
10 6 24 15

Expected output:
0


Actual output:
1


Fixed submission (verdict: Accepted):
n = int(input())
a = list(map(int, input().split()))

t = True
x = -1

while t == True:
  x += 1
  for i in a:
    if i%2 == 0:
      continue
    else:
      t = False
  a = list(map(lambda x:x/2, a))  

      
print(x)

Problem: p03494
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
n=int(input())
A=list(map(int,input().split()))
count=0

while True:
  if sum(A) %2 !=0:
    print(count)
    exit()
  else:
    A=list(map(lambda x:x/2,A))
    count+=1


Failing test case input:
6
586050932 1154626501 30334838 27068201 10685560 243833698

Expected output:
0


Actual output:
1


Fixed submission (verdict: Accepted):

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

while True:
  if (sum(list(map(lambda x:x%2,A))))!= False:
    print(count)
    exit()
  else:
    A=list(map(lambda x:x/2,A))
    count+=1
Problem: p03494
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
def calc(c, cnt):
    if sum(c) % 2 == 1:
        print(cnt)
        return 1
    else:
        for k, num in enumerate(c):
            c[k] = num / 2
        cnt += 1
        if calc(c, cnt) == 1:
            return 1
        

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


Failing test case input:
6
105530884 1892549229 59907007 27068201 236966 442481745

Expected output:
0


Actual output:
4


Fixed submission (verdict: Accepted):
def calc(c, cnt):
    r = [i % 2 for i in c]
    if sum(r) > 0:
        print(cnt)
        return 1
    else:
        for k, num in enumerate(c):
            c[k] = num / 2
        cnt += 1
        if calc(c, cnt) == 1:
            return 1
        

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

Problem: p03494
Buggy submission (PyPy3 (2.4.0), verdict: Wrong Answer):
N = int(input())
A = list(map(int, input().split()))

ret = 0
flag = True
while(flag):
  for i in range(3):
    if(A[i] % 2 != 0):
      flag = False
    else:
      A[i] /= 2
  if(flag):
    ret += 1  
print(ret)

Failing test case input:
6
71148002 1800176736 26596048 5864889 174453 1171612875

Expected output:
0


Actual output:
1


Fixed submission (verdict: Accepted):
N = int(input())
A = list(map(int, input().split()))

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

Problem: p03494
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
N = int(input())
lst = [int(x) for x in input().split()]
i = 0
tmp = 0
while tmp > 0:
  tmp = sum([x%2 for x in lst])
  lst = [x/2 for x in lst]
  i += 1
print(i-1)

Failing test case input:
6
71148002 1800176736 117468765 5864889 179710 1171612875

Expected output:
0


Actual output:
-1


Fixed submission (verdict: Accepted):
N = int(input())
lst = [int(x) for x in input().split()]
i = -1
tmp = 0
while tmp == 0:
  tmp = sum([x%2 for x in lst])
  lst = [x/2 for x in lst]
  i += 1
print(i)

Problem: p03494
Buggy submission (PyPy3 (2.4.0), verdict: Wrong Answer):
N = input()
A = list(map(int,input().split()))
count = 0
exist_odd = False

while (exist_odd == False):
  for x in A:
    if x % 2 != 0:
      exist_odd = True
      
  if exist_odd == True:
    break
  else:
    A = [x-1 for x in A]
  count += 1
print(count)
        

Failing test case input:
3
8 12 40

Expected output:
2

Actual output:
1


Fixed submission (verdict: Accepted):
N = input()
A = list(map(int,input().split()))
count = 0
exist_odd = False

while (exist_odd == False):
  for x in A:
    if x % 2 != 0:
      exist_odd = True
      
  if exist_odd == True:
    break
  else:
    A = [x/2 for x in A]
  count += 1
print(count)
Problem: p03494
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
N = int(input())
A = list(map(int, input().split()))
B = [ ]
c = 0
for i in A:
  B.append(list(bin(i)))
for i in range(10000):  
  for j in range(N):
    if B[j][-i-1] == '0':
      continue
    else:
      c = i
      break
  if c == 1 and j == 1:
    print(0)
    break
  elif c>0:
    print(i)
    break

Failing test case input:
3
10 12 27

Expected output:
0


Actual output:
1


Fixed submission (verdict: Accepted):
N = int(input())
A = list(map(int, input().split()))
B = [ ]
c = -1
for i in A:
  B.append(list(bin(i)))
for i in range(10000):  
  for j in range(N):
    if B[j][-i-1] == '0':
      continue
    else:
      c = i
      break
  if c == 0:
    print(0)
    break
  elif c>0:
    print(i)
    break

Problem: p03494
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
def main():
    N = int(input())
    num = list(map(int, input().split()))
    counter = [0] * N
    for j in range(N):
        while num[j]%2==0:
            num[j] = num[j]/2
            counter[j] += 1
    print(min(counter))

Failing test case input:
6
71148002 1800176736 81412222 7499695 179710 734273188

Expected output:
0


Actual output:

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

main()

Problem: p03494
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
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)

Failing test case input:
3
9 25 16

Expected output:
0


Actual output:
[9, 25, 16] 0
0


Fixed submission (verdict: Accepted):
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(S)

Problem: p03494
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
l = list(input().split(","))

d = [0]
count = 0
max_count = 0

for n in l:
    while int(n) % 2 == 0:
        n = int(n)/2
        count = count + 1
    if max_count < count:
        max_count = count
    count = 0

print(max_count)

Failing test case input:
4
9 6 43 9

Expected output:
0


Actual output:
2


Fixed submission (verdict: Accepted):
number = input()
l = list(input().split(" "))

loop_count = 0
count = 0
min_count = 0

for n in l:
    loop_count = loop_count + 1
    while int(n) % 2 == 0:
        n = int(n)/2
        count = count + 1
    if loop_count == 1:
        min_count = count
    elif min_count > count:
        min_count = count
    count = 0

print(min_count)
Problem: p03494
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
a = int(input())
num_list = list(map(int,input().split()))
max_count = 0
for i in num_list:
    count = 0
    while True:
        if i%2 == 0:
            count += 1
            i = i/2
        else:
            break
        if count > max_count:
            max_count = count
print(max_count)

Failing test case input:
6
105530884 1892549229 59907007 27068201 236966 442481745

Expected output:
0


Actual output:
2


Fixed submission (verdict: Accepted):
a = int(input())
num_list = list(map(int,input().split()))
count = 0
true = True
while true:
    for i in range(a):
        if num_list[i]%2 == 0:
            num_list[i] = num_list[i]/2
        else:
            true = False
            count -= 1
            break
    count += 1
print(count)

Problem: p03494
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
N = int(input())
num = list(map(int, input().split(" ")))
oparation = 10 ^ 8

for i in range(N):
    temp = 0
    while(1):
        if(num[i] % 2 or num[i] == 0):
            break
        else:
            num[i] /= 2
            temp += 1
    if(oparation > temp):
        oparation = temp

print(oparation)


Failing test case input:
6
382253568 723152896 37802240 379425024 404894720 471526144

Expected output:
8

Actual output:
2


Fixed submission (verdict: Accepted):
N = int(input())
num = list(map(int, input().split(" ")))
oparation = 10 ** 8

for i in range(N):
    temp = 0
    while(1):
        if(num[i] % 2 or num[i] == 0):
            break
        else:
            num[i] /= 2
            temp += 1
    if(oparation > temp):
        oparation = temp
        
print(oparation)

Problem: p03494
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
N = int(input())
arr =  [int(i) for i in input().split()] 

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




Failing test case input:
4
10 6 24 10

Expected output:
1


Actual output:

Fixed submission (verdict: Accepted):
N = int(input())
arr =  [int(i) for i in input().split()] 

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


print(count)

Problem: p03494
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
def counter(a):
  count = 0 
  while a%2 ==0:
    a /= 2
    count += 1
  return count
s = [int(n) for n in input().split()]
print(min([counter(a) for a in s]))

Failing test case input:
4
5 6 8 10

Expected output:
0

Actual output:
2


Fixed submission (verdict: Accepted):
def counter(a):
  count = 0 
  while a%2 ==0:
    a /= 2
    count += 1
  return count
N = int(input())
s = [int(n) for n in input().split()]
print(min([counter(a) for a in s]))
Problem: p03494
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
N = int(input())
data = list(map(int, input().split()))

count = 0

while sum(data) % 2 == 0:
    for i in range(len(data)):
        data[i] = data[i] / 2

    if sum(data) % 2 == 0:
        count += 1

print(count)


Failing test case input:
4
12 6 17 9

Expected output:
0


Actual output:
1


Fixed submission (verdict: Accepted):

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

def div(n):
    count = 0
    while n %2 == 0:
        n /= 2
        count += 1
    return count

ans = min(list(map(div, data)))
print(ans)

Problem: p03494
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
n = int(input())
list = list(map(int, input().split()))
b = 0
cont = True

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

Failing test case input:
3
1 36 38

Expected output:
0


Actual output:
1


Fixed submission (verdict: Accepted):
n = int(input())
list = list(map(int, input().split()))
b = -1
cont = True

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

Problem: p03494
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
N = int(input())
A = list(map(int, input().split()))
B = []
flg = True
for a in A:
  i = 0
  while flg:
    if a % 2 ** i == 0:
      i += 1
    else:
      B.append(i)
      flg = False
B.sort()
print(B[0])


Failing test case input:
6
348324507 1154626501 32183854 379425024 590201381 471526144

Expected output:
0


Actual output:
1


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

Problem: p03494
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
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)

Failing test case input:
6
71148002 1800176736 117468765 5864889 179710 734273188

Expected output:
0


Actual output:
[71148002, 1800176736, 117468765, 5864889, 179710, 734273188]
b
[71148002, 1800176736, 117468765, 5864889, 179710, 734273188]
0
0


Fixed submission (verdict: Accepted):
N = int(input())
A = list(map(int, input().split()))

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

devided, count = devide(A, 0)
print(count)
Problem: p03494
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
n = int(input())
array = list(map(int, input().split()))


def cal(value):
    return value / 2


def odd_even_cal(value):
    return value % 2


for i in range(n):
    if 0 not in list(map(odd_even_cal, array)):
        print(i + 1)
        break
    array = list(map(cal, array))

else:
    print(i + 1)


Failing test case input:
6
71148002 1320359906 59907007 21985869 236966 233525638

Expected output:
0


Actual output:
2


Fixed submission (verdict: Accepted):
n = int(input())
array = list(map(int, input().split()))


def cal(value):
    return value / 2


def odd_even_cal(value):
    return value % 2


flug, counter = -1, 0
while flug < 0:
    if 1 in list(map(odd_even_cal, array)) or 0 in array:
        flug = 1
        break
    counter += 1
    array = list(map(cal, array))

print(counter)

Problem: p03494
Buggy submission (Python (3.4.3), verdict: Wrong Answer):


tmp = input().split()
num = len(tmp)
min = int(tmp[0])
for j in tmp:
	d = int(j)
	n = 0
	while(d % 2 == 0):
		n=n+1
		d=d/2
	if(min>n):
		min=n
print(min)


Failing test case input:
6
71148002 1055849701 81412222 7499695 236966 734273188

Expected output:
0


Actual output:
1


Fixed submission (verdict: Accepted):


tmp = input()
tmp = input().split()
num = len(tmp)
min = int(tmp[0])

for j in tmp:
	d = int(j)
	n = 0
	while(d % 2 == 0):
		n=n+1
		d=d/2
	if(min>n):
		min=n

print(min)

Problem: p03494
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
N=int(input())
A=list(map(int,input().split()))
ans=0
f=1
while(f):
    for i in range(len(A)):
        if A[i]%2==0:A[i]/=2
        else: f=0
    ans+=1
print(ans)


Failing test case input:
3
9 36 16

Expected output:
0


Actual output:
1


Fixed submission (verdict: Accepted):
N=int(input())
A=list(map(int,input().split()))
ans=-1
f=1
while(f):
    for i in range(len(A)):
        if A[i]%2==0:A[i]/=2
        else: f=0
    ans+=1
print(ans)

Problem: p03494
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
i = int(input())
l = [int(n) for n in input().split(' ')]

t = 0
bool = True
while bool:
    t += 1
    for j in range(len(l)):
        if l[j] % 2 == 1:
            bool = False
            break
        else:
            l[j] /= 2
    print(l)
print(t-1)


Failing test case input:
4
10 6 43 24

Expected output:
0


Actual output:
[5.0, 3.0, 43, 24]
0


Fixed submission (verdict: Accepted):
i = int(input())
l = [int(n) for n in input().split(' ')]

t = 0
bool = True
while bool:
    t += 1
    for j in range(len(l)):
        if l[j] % 2 == 1:
            bool = False
            break
        else:
            l[j] /= 2
print(t-1)