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: Accepted

Solution code:
from copy import deepcopy
def howmanytimes(x):
	global count
	flag=False	
	for i in range(len(x)):
		if x[i]%2==0:
			x[i]=int(x[i]/2)
		else:
			flag=True
	if flag:
		return 0
	else:
		count+=1
		howmanytimes(x)
	
			
a=int(input())
t=list(map(int,input().split()))
q=deepcopy(t)
count=0
howmanytimes(q)
print(count)

Submission status: Accepted

Solution code:
import math

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

mincnt = 250

for i in range(N):
    tmp = A[i]
    tmpcnt = 0
    while tmp%2 == 0:
        tmp = math.floor(tmp/2)
        tmpcnt += 1

    if mincnt > tmpcnt:
        mincnt = tmpcnt

print(mincnt)

Submission status: Accepted

Solution code:
#coding:utf-8                                                                   

N = int(raw_input())
As = map(int, raw_input().split())

count = 0
flag = 0

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

print count

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = int(input())
A = input().split(" ")
ans =0
judge = True
while judge:
    temp = 0
    for i in range(len(A)):
        if int(A[i])%2 == 0:
            temp +=1
            A[i]=int(A[i])/2
    if temp == len(A):
        ans += 1
    else:
        judge=False
        
        print(ans)

Submission status: Accepted

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

import numpy as np
A = np.array(A)

ans = 0
while 1:
    if(sum(A%2) == 0):
        ans += 1
        A = A/2
    elif(sum(A%2) != 0):
        break;
print(ans)

Submission status: Accepted

Solution code:
def main():
    n=input()
    a=[int(i) for i in input().split()]
    ans=0
    f=False
    while True:
        for k,v in enumerate(a):
            if v%2==0:
                a[k]=a[k]//2
            else:
                print(ans)
                f=True
                break
        if f:
            break
        else:
            ans+=1

if __name__=='__main__':
    main()

Submission status: Accepted

Solution code:
#!/usr/bin/python

import sys

def main(argv):
    line = sys.stdin.readline()
    while line:
        N = line.rstrip("\n")
        A = map(lambda a: int(a), sys.stdin.readline().rstrip("\n").split(" "))
        count = 0
        flag = True
        while flag:
            for i in xrange(len(A)):
                if A[i] % 2 != 0:
                    flag = False
                    break
                A[i] = A[i] / 2
            else:
                count += 1
        print count

        line = sys.stdin.readline()

if __name__ == "__main__":
    main(sys.argv)

Submission status: Accepted

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

    c = 0
    while 1:
        if all(A[i] % 2 == 0 for i in range(N)):
            for j in range(N):
                A[j] /= 2
            c += 1
        else:
            break
    print(c)


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
import sys

line = sys.stdin.readline().strip()
N = int(line)

line = sys.stdin.readline().strip()
A = [int(x) for x in line.split()]

r = 0
while 1:
    if all(x % 2 == 0 for x in A):
        A = [x // 2 for x in A]
        r += 1
    else:
        break

print(r)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
import sys
N = int(sys.stdin.readline())
line = sys.stdin.readline()
A = [ int(i) for i in line.strip().split() ]
min = 999999
for a in A:
    cnt = 0
    while(min > cnt):
        if a%2 == 1:
            min = cnt
            break
        else:
            a = a/2
            cnt += 1
print(cnt)

Submission status: Accepted

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

ans = 10**1000
for a in A:
    counter = 0
    while(a%2 == 0):
        a = a//2
        counter += 1
    ans = min(ans,counter)
print(ans)

Submission status: Accepted

Solution code:
import numpy as np
n = int(input())
data = np.array(list(map(int, input().split())))
count = 0
while np.sum(data % 2 != 0) == 0:
    data = data / 2
    count += 1
print (count)

Submission status: Accepted

Solution code:
n = int(input())

a_s = input().split()
for i in range(n):
    a_s[i] = int(a_s[i])

cnt = 0
flag = True
while flag:
    for i in range(n):
        a_s[i] = a_s[i]/2
        if a_s[i]%1 == 0.5:
            print(cnt)
            flag = False
            break
        
    cnt += 1

Submission status: Accepted

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

def w(x):
  if x % 2 ==0:
    return x / 2
  else:
    return 0
n=0
while min(a)>0:
  a=[w(i) for i in a]
  n+=1
  if min(a)==0:
    n-=1
print(n)

Submission status: Accepted

Solution code:
def func(a):
  cr = 0
  num = a
  while(1):
    if num % 2:
      return cr
    else:
      num = num//2
      cr +=1

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

maxnum = max(l)

for i in range(int(n)):
  cr = func(l[i])
  maxnum = min(maxnum,cr)
  
print(maxnum)

Submission status: Accepted

Solution code:
# coding: utf-8
# Your code here!
import numpy as np
s=input()
a=list(map(int,input().split()))
na=np.array(a)
ans=0
while True:
    if sum(na%2)==0:
        na=na/2
        ans+=1
    else:
        break
print(ans)

Submission status: Accepted

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


print(c)

Submission status: Accepted

Solution code:
input()
num = map(int, raw_input().split())
n = int()
while True:
    num = map(lambda x: -1 if x%2 else x/2, num)
    if -1 in num:
        print n
        break
    n += 1

Submission status: Accepted

Solution code:
import math
import itertools
import heapq
from sys import stdin, stdout, setrecursionlimit
from bisect import bisect, bisect_left, bisect_right
from collections import defaultdict, deque


# d = defaultdict(lambda: 0)
# setrecursionlimit(10**7)
# inf = float("inf")


##### stdin ####
def LM(t, r): return list(map(t, r))
def R(): return stdin.readline()
def RS(): return R().split()
def I(): return int(R())
def F(): return float(R())
def LI(): return LM(int,RS())
def LF(): return LM(float,RS())
def ONE_SL(): return list(input())
def ONE_IL(): return LM(int, ONE_SL())
def ALL_I(): return map(int, stdin)
def ALL_IL(): return LM(int,stdin)

##### tools #####
def ap(f): return f.append
def pll(li): print('\n'.join(LM(str,li)))
def pljoin(li, s): print(s.join(li))



##### main #####		
def main():
	N = I()
	A = LM(lambda x:x/2, LI())
	_A = [i%2==0 for i in A]

	if sum(_A) == N:
		ans=1
		while sum(_A)==N:
			ans+=1
			A = [i/2 for i in A]
			_A = [i%2==0 for i in A]

	else:
		ans=0
	
	print(ans)

if __name__ == '__main__':
	main()

Submission status: Accepted

Solution code:
n = int(input())
nums = list(map(int, input().split()))
count = 0
def judge(n, nums, count):
  for i in range(10000):
    for j in range(n):
      if nums[j] % 2 == 0:
        nums[j] /= 2
      else:
        return count
    count += 1

print(judge(n, nums, count))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N=int(input())
st=input().split()
count=30
for i in range(N):
    a=int(st[i])
    cp=0
    while(True):
        if a%2==1:
            break
        else:
            a=a//2
            cp+=1
    if count>cp:
        count=cp
print(count)

Submission status: Accepted

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

Submission status: Accepted

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

result = 0
while True:
    num = [A[i] % 2**(result + 1) for i in range(N)]
    if num.count(0) != N:
        break
    result += 1

print(result)

Submission status: Accepted

Solution code:
N = int(input())
listA = list(map(int,input().split()))
count = [0 for i in range(N)]

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


print(min(count))

Submission status: Accepted

Solution code:
 
N = int(input())
s = input().split()
s = [int(i) for i in s]
ans = []
for i in range(N):
    ans_sub = 0
    while s[i] / 2 == int(s[i] / 2) : 
        ans_sub += 1
        s[i] /= 2
    ans.append(ans_sub)
print(min(ans))

Submission status: Accepted

Solution code:
num = int(input())
val = [int(x) for x in input().split()]

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

print(cnt)

Submission status: Accepted

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

ans = 0
while True:
    ok = True
    for i, a in enumerate(A):
        if a % 2 == 0:
            A[i] //= 2
        else:
            ok = False
            break
    if not ok:
        break
    ans += 1

print(ans)

Submission status: Accepted

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

ans = float("inf")
for i in range(n):
    if(a[i] % 2 == 1):
        ans = 0
        break
    else:
        tmp = a[i]
        count = 0
        while(tmp % 2 == 0):
            tmp /= 2
            count += 1
        if(count < ans):
            ans = count
print(ans)

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n = input()
xs = map(int, raw_input().split())
m = 2000000000
for i in range(n):
    x = xs[i]
    c = 0
    while x % 2 == 0 and c < m:
        x = x / 2
        c += 1
    m = min(c, m)
print m

Submission status: Accepted

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

c=float('inf')
for a in A:
  t=0
  while a%2==0:
    t+=1
    a/=2
  c=min(t,c)

print c

Submission status: Accepted

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:
num = int(input())

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

cnt = 0
while(True)
	for i in range(num):
    	if vals[i] % 2 == 1:
        	print(cnt)
        	break
        else:
    		vals[i] = vals[i] / 2
        cnt += 1

Submission status: Runtime Error

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

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

print(t)

Submission status: Runtime Error

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

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

print(ans)

Submission status: Runtime Error

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

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

print(ans)

Submission status: Runtime Error

Solution code:
n = int(input())
li = list(map(int, input().split())
b = float('inf')

for a in li:
    c = 0
	while a%2 == 0:
      a = a/2
      c += 1
    b = min(b,c)
print(b)

Submission status: Runtime Error

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

for a in li:
    c = 0
	while a%2 == 0:
      a = a/2
      c += 1
    b = min(b,c)
print(b)

Submission status: Runtime Error

Solution code:
a = int(input())
li = list(map(int, input().split())
b = float('inf')

for a in li:
          c = 0
	while a%2 == 0:
          a = a/2
          c += 1
          b = min(b,c)
print(b)

Submission status: Runtime Error

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

for a in li:
          c = 0
	while a%2 == 0:
          a = a/2
          c += 1
          b = min(b,c)
    print(b)

Submission status: Runtime Error

Solution code:
# coding: utf-8

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

c = 0
count = 0
imp = 0

while imp == 0:
    for i in range(0..N+1):
        if A[i] % 2 == 0:
            c += 1
            continue
        else:
            imp = 1
            break

    if c == N and imp == 0:
        for i in range(0..N+1):
            A[i] = int(A[i] / 2)
            count += 1

print(count)

Submission status: Runtime Error

Solution code:
N = input()
A = list(map(int,input().split()))
ans = 0
def GCD(a,b):
    if a < b:
        a,b = b,a
    while a % b != 0:
        a,b = b, a % b
    print(b)

if __name__ =="__main__":
    for i in range(N-1):
       ans = GCD(A[i],A[i+1])
    print(ans)

Submission status: Runtime Error

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

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

i = 0
while True:
    a_ans = divmod(a, 2)
    b_ans = divmod(b, 2)
    c_ans = divmod(c, 2)
    if a_ans[1] == 0 and b_ans[1] == 0 and c_ans[1] == 0 and a !=0 and b !=0 and c !=0:
        i += 1
        a = a_ans[0]
        b = b_ans[0]
        c = c_ans[0]
    else:
        break
print(i)

Submission status: Runtime Error

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

i = 0
while True:
    a_ans = divmod(a, 2)
    b_ans = divmod(b, 2)
    c_ans = divmod(c, 2)
    if a_ans[1] == 0 and b_ans[1] == 0 and c_ans[1] == 0:
        i += 1
        a = a_ans[0]
        b = b_ans[0]
        c = c_ans[0]
    else:
        break
print(i)

Submission status: Runtime Error

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

ans = float("inf")
for i in range(N):
  a = A[i]
  ans_tmp = 0
  while a%2==0:
    a = a//2
    ans_tmp += 1
  ans = min(ans_tmp, ans)
print(ans)

Submission status: Runtime Error

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

flg = True
cnt = 0

while flg = True:
    for i in range(N):
        if A[i]%2 = 1 then:
            flg = False
            break
    cnt += 1
    A = [a/2 for a in A]

print(cnt)

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
n = int(input())
a = [int(input()) for i in range(n)]
l = [0 for i in range(n)]
for i in range(len(a)):
    while a[i] % 2 == 0:
        a[i] /= 2
        l[i] += 1
print(min(l))

Submission status: Runtime Error

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

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

print(cnt)

Submission status: Runtime Error

Solution code:
n=int(input())
a = list(map(int,input().split()))
count =1
 
while all(a[i]%(2**count)==0):
  count+=1
print(count-1)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

for i in range(n):
  if all(a[i]%(2**count)==0):
    count+=1
  else:
    print(count-1)
    break

Submission status: Runtime Error

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

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 all(a[i]%2==0):
      all(a[i]==a[i]/2)
      count+=1
    else:
      print(count)
      break

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
#3
#8 12 40
n=int(input())
ai=list(map(int(),input.split()))
b=[]
for a in ai:
  count =0
  while a%2==0 :
    count+=1
    a/=2
  b.append(count)
print(min(b))

Submission status: Runtime Error

Solution code:
#3
#8 12 40
n=int(input())
ai=list(map(int(),input().split()))
b=[]
for a in ai:
  count =0
  while a%2==0 :
    count+=1
    a/=2
  b.append(count)
print(min(b))

Submission status: Runtime Error

Solution code:
#3
#8
n=int(input())
ai=list(map(int(),input.split()))
        
for a in ai:
  count =0
  while a%2==0 :
    count+=1
    a/=2
  b.append(count)
print(min(b))

Submission status: Runtime Error

Solution code:
#3
#8 12 40
n=int(input())
ai=list(map(int(),input.split()))
        
for a in ai:
  count =0
  while a%2==0 :
    count+=1
    a/=2
    b.append(count)
print(min(b))

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
N = gets.to_i
A = gets.split(' ').map(&:to_i)

ans = 0
while A[0] > 1 do
    for i in 0..N-1 do
        if A[i] % 2 == 0 then
            A[i] /= 2
        else
            puts ans
            exit
        end
    end
    ans += 1
end

puts ans

Submission status: Runtime Error

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

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

Submission status: Runtime Error

Solution code:
n = int(input())
l = 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(cnt)

Submission status: Runtime Error

Solution code:
n = int(input())
l = 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:
import(sys)
n=int(input())
a = list(map(int,input().split()))
b=0
while(True):
  for i in range(n):
    if(a[i]%2!=0):
      print(b)
      sys.exit()
    a[i]=a[i]//2
  b+=1
print(b)

Submission status: Runtime Error

Solution code:
n = input()
l = input().split()
cnt = 0
while len([True for x in l if x%2==0]):
  l = [x/2 for x in l]
  cnt += 1
print(cnt)

Submission status: Runtime Error

Solution code:
n = input()
l = input().split()
cnt = 0
while len([True for x in l if l%2==0]):
  l = [x/2 for x in l]
  cnt += 1
print(cnt)

Submission status: Runtime Error

Solution code:
l = input().split()
cnt = 0
while len([True for x in l if l%2==0]):
  l = [x/2 for x in l]
  cnt += 1
print(cnt)

Submission status: Runtime Error

Solution code:
n = int(input())
m = float("inf")
a = list(map((int, input().split())))
for i in range(a):
	if m > len(bin(i))-bin(i).rfind("1")-1:
		m = len(bin(i))-bin(i).rfind("1")-1
print(m)

Submission status: Runtime Error

Solution code:
import sys
n = int(input())
m = float("inf")
a = list(map((int, input().split())))
for i in range(a):
	if m > len(bin(i))-bin(i).rfind("1")-1:
		m = len(bin(i))-bin(i).rfind("1")-1
print(m)

Submission status: Runtime Error

Solution code:
import sys
n = int(input())
a = [map(int, input().split())]
p = 1
for i in range(n):
	p = p*a[i]
for k in range(6*n):
	l = p%(2**k)
	if l == 1:
		print(k)
		sys.exit()

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
a = int(input()) // 値の数
b = list(map(int, input().split()))
count = 0
while(1):
  for i in range(0, a, 1):
    if (b[i] % 2 == 1) :
      break;
  for i in range(0, a, 1):
    b[i] /= 2
  count += 1
print(count)

Submission status: Runtime Error

Solution code:
a = int(input()) // 値の数
b = list(map(int, input().split()))
count = 0
while(1):
  for i in range(0, a, 1):
    if (b[i] % 2 == 1) :
      break;
  for i in range(0, a, 1):
    b[i] /= 2
    count += 1
print(count)

Submission status: Runtime Error

Solution code:
a = int(input()) // 値の数
b = list(map(int, input().split()))
min = 100000
for i in range(a):
  try = 0
  while(b[i]%2 == 0):
    b[i] = b[i] / 2
    try += 1
  if try < min:
    min = try
print(min)

Submission status: Runtime Error

Solution code:
a = int(input()) // 値の数
b = list(map(int, input().split()))
min = 100000
for i in range(a):
  try = 0
  while(b[i]%2 != 0):
    b[i] = b[i] / 2
    try += 1
  if try < min:
    min = try
print(min)

Submission status: Runtime Error

Solution code:
a = int(input()) // 数の個数
b = list(map(int, input().split())) // それぞれの値
min = 100000
for i in range(a):
  n = 0
  try = 0
  while(2**n <= b[i]):
    try += (b[i] / 2**n)
  if try < min :
    min = try
print(min)

Submission status: Runtime Error

Solution code:
a = int(input()) // 数の個数
b = list(map(int, input().split())) // それぞれの値
min = 100000
for i in range(a):
  if (min > (b[i]/2)):
    min = b[i]/2
print(min)

Submission status: Runtime Error

Solution code:
a = input() // 数の個数
b = list(map(int, input().split())) // それぞれの値
count = 0
while(1):
  for i in range(a):
    if b[i] % 2 == 1:
      break;
    else :
      b[i] /= 2
  count += 1
print(count)

Submission status: Runtime Error

Solution code:
a = input() // 数の個数
b = list(map(int, input().split())) // それぞれの値
count = 0
while(1):
  for i in range(a):
    if b[i] % 2 == 1:
      print("0")
      return 0;
  b /= 2
  count += 1
print(count)

Submission status: Runtime Error

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

count = 0

for i in y:
    if i % 2 = 0:
        y[i] == i % 2
        count += 1
    else:
        pass

Submission status: Runtime Error

Solution code:
    num_count = input()
    nums = map(int, input().split(' '))
    result = 0
    while True:
        for num in nums:
            if num % 2 != 0:
                print(result)
                return
        result+=1

Submission status: Runtime Error

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

t = True
x = 0

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

Submission status: Runtime Error

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

count = 0
while 1:
    count+=1
print(count)

Submission status: Runtime Error

Solution code:

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

count = 0
while 1:
    count+1

print(count)

Submission status: Runtime Error

Solution code:

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

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

Submission status: Runtime Error

Solution code:
import math 
N = input()
a =list(map(int,input().split()))
for i in a:
  B = min(len(bin(i)) -  bin(i).rfind("1") - 1)
print(B)

Submission status: Runtime Error

Solution code:
import math 
N = input().int()
A = map(int,input().split())
B = map(bin,A)
def Y(x):
  y = len(x)-x.rfind("1")-1
  return y
C = map(Y,B)
print(min(C))

Submission status: Runtime Error

Solution code:
N = input().int()
A = map(int,input().split())
B = map(bin,A)
def Y(x):
  y = len(x)-x.rfind("1")-1
  return y
C = map(Y,B)
print(min(C))

Submission status: Runtime Error

Solution code:
N = int(input())
a = []
for i in range(N):
  b = int(input())
  a.append(b)
  
c = 0

for an in a:
  if not an % 2 == 0:
    print(0)
    break
  else:
    c +=1

print(c)

Submission status: Runtime Error

Solution code:
n = int(raw_input())
ais = map(int, raw_input().split())
c = 0
while(True):
  	if all([ai%2==0 for ai in ais ]):
	  	ais = [ai/2 for ai in ais]	
        c +=1
	else:
      	break
print c

Submission status: Runtime Error

Solution code:
N=int(input())
an=list(map(int,input().split()))
n=0
for i in range(N):
    if an%2==0:
        n+=1
print(an/2)

Submission status: Runtime Error

Solution code:
N  = int(input())
x = map(int,input().split())
count=0
check = 0
NEW_x=[]

def roop(N,x):
    global check
    global NEW_x
    for i in x:
        if i%2==0:
            check +=1
            s = i//2
            NEW_x.append(s)


        else:
            NEW_x.append(s)

roop(N,x)

while True:
  
    x = NEW_x
    NEW_x = []
    if check ==N:
        check=0
        count+=1
        roop(N,x)
    else:
        break

print(count)

Submission status: Runtime Error

Solution code:
n = input()
a_list = input().split(" ")

def count_divide(number, max_cnt=-1):
  count = 0
  mod = -1
  while mod != 0:
    q, mod = divmod(number)
    count += 1
    if max_cnt != -1 & count >= max_cnt:
      return max_cnt
  return count

result = -1
for a in a_list:
  result = count_divide(int(a), result)
print(result)

Submission status: Runtime Error

Solution code:
import copy
 
kaisu = int(input())
 
s_suji_list = input().split(' ')
suji_list = []
count = 0
cotinule_flg = True
for suji in s_suji_list:
  i_suji = int(suji)
  if suji % 2 == 0:
    suji_list.append(suji / 2)
  else:
    continue_flg = False
    break
count = 1
 
while(continue_flg):
  temp_list = copy.copy(suji_list)
  suji_list.clear()
  count += 1
  for suji in temp_list:
    if suji % 2 == 0:
      suji_list.append(suji / 2)
    else:
      count -= 1
      continue_flg = False
      break
 
print(count)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
n = input()

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

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

Submission status: Runtime Error

Solution code:
import copy

kaisu = int(input())

s_suji_list = input().split(' ')
suji_list = []
count = 0
cotinule_flg = true
for suji in s_suji_list:
  i_suji = int(suji)
  if suji % 2 == 0:
    suji_list.append(suji / 2)
  else:
    continue_flg = false
    break
count = 1

while(continue_flg):
  temp_list = copy.copy(suji_list)
  suji_list.clear()
  count += 1
  for suji in temp_list:
    if suji % 2 == 0:
      suji_list.append(suji / 2)
    else:
      count -= 1
      continue_flg = false
      break

print(count)

Submission status: Runtime Error

Solution code:
import sys

readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
read = sys.stdin.buffer.read
sys.setrecursionlimit(10 ** 7)
INF = float('inf')

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


ans = INF
for a in A:
    cnt = 0
    while True:
        q, mod = divmod(a, 2)
        if mod != 0:
            break
        cnt += 1
        a = q
    ans = min(ans, cnt)
print(ants)

Submission status: Runtime Error

Solution code:
from sys import stdin

n = stdin.readline().rstrip()
a = [int(x) for x in stdin.readline().rstrip().split()]

count = 0
b = a[0]
while True:
    if b % 2 == 1: break
    b = b//2
    count = count + 1
minc = count

for b in a[1:]:
  	count = 0
    while True:
        if b % 2 == 1: break
        b = b//2
        count = count + 1

    minc = min([minc, count])

print(minc)