Problem:


Score : 200 points

Problem Statement

There are N positive integers written on a blackboard: A_1, ..., A_N.

Snuke can perform the following operation when all integers on the blackboard are even:

Replace each integer X on the blackboard by X divided by 2.

Find the maximum possible number of operations that Snuke can perform.

Constraints

1 \leq N \leq 200

1 \leq A_i \leq 10^9

Input

Input is given from Standard Input in the following format:

N
A_1 A_2 ... A_N

Output

Print the maximum possible number of operations that Snuke can perform.

Sample Input 1

3
8 12 40

Sample Output 1

2

Initially, [8, 12, 40] are written on the blackboard.
Since all those integers are even, Snuke can perform the operation.

After the operation is performed once, [4, 6, 20] are written on the blackboard.
Since all those integers are again even, he can perform the operation.

After the operation is performed twice, [2, 3, 10] are written on the blackboard.
Now, there is an odd number 3 on the blackboard, so he cannot perform the operation any more.

Thus, Snuke can perform the operation at most twice.

Sample Input 2

4
5 6 8 10

Sample Output 2

0

Since there is an odd number 5 on the blackboard already in the beginning, Snuke cannot perform the operation at all.

Sample Input 3

6
382253568 723152896 37802240 379425024 404894720 471526144

Sample Output 3

8



Sample input:
3
8 12 40


Sample output:
2

Submission status: Wrong Answer

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

ans = 0
s = sum(A)
while s % 2 == 0:
    s /= 2
    ans += 1
print(ans)

Submission status: Wrong Answer

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

for i in range(len(A)):
    if A[i] % 2 == 1:
        print(i)
        break

Submission status: Wrong Answer

Solution code:
n = int(input())
a_list = list(map(int, input().split()))
new_list = []
ans = 0
while True:
    for i in a_list:
        if i % 2 == 1:
            break
        else:
            a = i // 2
            new_list.append(a)
    if len(new_list) <= 2:
        break
    ans += 1
    a_list = new_list
    new_list = []

print(ans)

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

def judge(L, n):
   c = 0
   for i in range(N):
      if L[i] % (2 ** n) != 0:
         c += 1
         break
   if c == 0:
      return True
   else:
      return False


for i in range(1, 30):
   if judge(lst, 1):
      for j in range(N):
         lst[j] = lst[j] // 2
   else:
      print(i-1)
      break

Submission status: Wrong Answer

Solution code:
n=int(input())
a=list(map(int,input().split()))
b=[]
cnt=0
for i in range(n):
    if a[i]%2==1:
        print('0')
        exit()
    else:
        while a[i]%2==0:
            cnt += 1
            a[i] /= 2
        b.append(cnt)
print(min(b)-1)

Submission status: Wrong Answer

Solution code:
n=int(input())
a=list(map(int,input().split()))
b=[]
cnt=0
for i in range(n):
    if a[i]%2==1:
        print('0')
        exit()
    else:
        while a[i]%2==0:
            cnt += 1
            a[i] /= 2
        b.append(cnt)
print(min(b))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
n=int(input())
a=list(map(int,input().split()))
b=[]
cnt=0
for i in range(n):
    while a[i]%2==0:
       a[i] //= 2
       cnt += 1
    b.append(cnt)
cnt = 0
if min(b)!=0:
    print(min(b)-1)
else:
    print('0')

Submission status: Wrong Answer

Solution code:
n=int(input())
a=list(map(int,input().split()))
b=[]
cnt=0
for i in range(n):
    while a[i]%2==0:
       a[i] /= 2
       cnt += 1
    b.append(cnt)
cnt = 0
if min(b)!=0:
    print(min(b)-1)
else:
    print('0')

Submission status: Wrong Answer

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

if min(b)!=0:
    print(min(b)-1)
else:
    print('0')

Submission status: Wrong Answer

Solution code:
n=int(input())
a=list(map(int,input().split()))
b=[]
cnt=0
for i in range(n):
    while a[i]%2==0:
       a[i] /= 2
       cnt += 1
    b.append(cnt)
if min(b)!=0:
    print(min(b)-1)
else:
    print('0')

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
_ = int(input())
a = list(map(int, input().split()))
res = 0
while True:
    suma = int(sum(a))
    if suma % 2 == 0:
        a = list(map(lambda x: x / 2, a))
        res += 1
    else:
        print(res)
        break

Submission status: Wrong Answer

Solution code:
def resolve():
    import re
    N = int(input())
    An = input().split()
    ret = min(
        len((re.findall("0+$", bin(int(a))) + [""])[0])
        for a in An)

    print(ret)

Submission status: Wrong Answer

Solution code:
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)

Submission status: Wrong Answer

Solution code:
#-*-coding:utf-8-*-
import sys
input=sys.stdin.readline

def main():
    boards=[]
    n = int(input())
    boards=list(map(int,input().split()))
    data=sum(boards)
    count=0

    if data%2!=0:
        print(count)
        exit()

    while True:
        if data%2==0:
            data=data//2
            count+=1
        else:
            break

    print(count)


if __name__=="__main__":
    main()

Submission status: Wrong Answer

Solution code:
#-*-coding:utf-8-*-
import sys
input=sys.stdin.readline

def main():
    boards=[]
    n = int(input())
    boards=list(map(int,input().split()))
    data=sum(boards)
    count=0

    if data%2!=0:
        print(count)

    while True:
        if data%2==0:
            data=data//2
            count+=1
        else:
            break

    print(count)


if __name__=="__main__":
    main()

Submission status: Wrong Answer

Solution code:
n = int(input())
a = list(map(int, input().split()))
b = [bin(i)[2:] for i in a]
c = [0] * n
for i,v in enumerate(b):
  for j in v[::-1]:
    if j == '0':
      c[i] += 1
print(max(c))

Submission status: Wrong Answer

Solution code:
# -*- coding: utf-8 -*-
# 整数の入力
n = int(input())
a = list(map(int,input().split()))

i = 0
ans = 0
check = True
while check:
    while i<=n-1:
        if a[i]%2 == 1:
            check = False
            break
        else:
            a[i] /= 2
            i += 1
    ans += 1

print(ans)

Submission status: Wrong Answer

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

cnt = 0
while True:
  check = sum(S)
  if check % 2 == 0 and check > 0:
    S = [n//2 for n in S]
    cnt += 1
  else:
    break
    
print(cnt)

Submission status: Wrong Answer

Solution code:
from decimal import Decimal

N = int(input())
S = list(map(Decimal,input().split()))

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

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

print(cnt)

Submission status: Wrong Answer

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

while(1):
  exit = False
  for i in range(len(A)):
    if(A[i]%2 == 1): 
      exit = True
  if(exit == True): break
  for i in range(len(A)):
    A[i] /= 2
  cnt += 1
print(cnt)

Submission status: Wrong Answer

Solution code:
from sys import stdin
readline = stdin.buffer.readline
read = stdin.buffer.read
def i_input(): return int(input().rstrip())
def i_map(): return map(int, input().rstrip().split())
def i_list(): return list(i_map())

def main():
    N = i_input()
    A = sum(i_list())        
    ans = 0
    while A % 2 == 0:
        A //= 2
        ans += 1
    print(ans)

if __name__ == "__main__":
    main()

Submission status: Wrong Answer

Solution code:
from sys import stdin
n = stdin.readline().rstrip()
a = [int(x) for x in stdin.readline().rstrip().split()]
b = 0

print(a)

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

print(b)

Submission status: Wrong Answer

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

asum = sum(a)
ans = 0
while True:
    if asum%2 == 0:
        ans += 1
        asum = asum//2
    else:
        break
print(ans)

Submission status: Wrong Answer

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

i = 0
per = True
while per == True:
    for index in range(n):
        num = a[index]
        ans = divmod(num, 2)
        if num == 0 or ans[1] != 0:
            per = False
            break
        a[index] = ans[0]
    i += 1
print(i)

Submission status: Wrong Answer

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

while(True):
    T = False
    for i in range(len(a)):
        a[i] = a[i] / 2
        if a[i]%2 != 0:
            T=True

    count+=1
    if T:
        break

print(count)

Submission status: Wrong Answer

Solution code:
a = int(input())
b = [int(i) for i in input().split(" ")]
count = 0
iti = 1
while iti == 1:
    for i in range(a):
        if b[i]%2 == 0:
            b[i]=b[i]//2
            iti = 1
        else :
            print(count)
            iti = 0
        break
    count = count+1

Submission status: Wrong Answer

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

res = float('inf')

for i in A:
    cnt = 0
    while True:
        if i % 2 == 1:
            res = cnt
            if res == 0:
                print(0)
                exit()
            elif cnt < res:
                res = cnt
                break
            else:
                break
        i = i // 2
        cnt += 1

print(res)

Submission status: Wrong Answer

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

count = 0
summa = sum(A)
while summa % 2 == 0:
    summa = summa // 2
    count += 1

print(count)

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
def calc(n):
    return n / 2

a=int(input())
c=list(map(int, input().split()))
s=sum(c)
ans=0
if s%2!=0:
    print(0)
else:
    while s%2==0:
        c=list(map(calc, c))
        s=sum(c)
        ans+=1
        #print(c)
    print(ans)

Submission status: Wrong Answer

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

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

print(count)

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
# coding = utf-8
n=input("")
a=input("")
a=a.split(" ")
a=[int(s) for s in a]
a.sort()
base=100000
n=1
for num in a:
    while num%2**n==0:
        n=n+1
    if n < base:
        base=n
base=base-1
print(base)

Submission status: Wrong Answer

Solution code:
# coding = utf-8
n=input("")
a=input("")
a=a.split(" ")
a=[int(s) for s in a]
a.sort()
base=100000
n=0
for num in a:
    while num%2**n==0:
        n=n+1
    if n < base:
        base=n
base=base-1
print(base)

Submission status: Wrong Answer

Solution code:
# coding = utf-8
n=input("")
a=input("")
a=a.split(" ")
a=[int(s) for s in a]
a.sort()
base=100000
n=0
for num in a:
    while num%2**n==0:
        n=n+1
        print(n)
    if n < base:
        base=n
print(base)

Submission status: Wrong Answer

Solution code:
# coding = utf-8
n=input("")
a=input("")
a=a.split(" ")
a=[int(s) for s in a]
a.sort()
base=100000
n=0
for num in a:
    while num%2**n==0:
        n=n+1
        print(n)
    if n < base:
        base=n
base=base-1
print(base)

Submission status: Wrong Answer

Solution code:
# coding = utf-8
f=input("")
ra=input("")
a=ra.split()
lista=[int(s) for s in a]
mix=1
base=0
cnt=0
for num in lista:
    for n in range(30):
        if num % 2**n ==0 :
            cnt+=1
            if base<n:
                base=n
            
print(base)

Submission status: Wrong Answer

Solution code:
# coding = utf-8
f=input("")
ra=input("")
a=ra.split()
lista=[int(s) for s in a]
mix=1
base=0
for num in lista:
  for n in range(9):
    if num % 2**n :
      pass
    else:
      break
    if base<n:
      bace=n
print(n)

Submission status: Wrong Answer

Solution code:
N = int(input())  # nは入力回数
num_list =  list(map(int, input().split()))
    
count = 0
actual_count = 0
w = 0
new_list = []
while (w == 0):
    for i in range(N):
        a = num_list[i]
        
        b = int(a) % 2 
        if (b == 0):
            count += 1
    if (count == N):
        for n in range(N):
            a = num_list[n]
            b = int(a) / 2
            new_list.append(b)
        num_list = []
        for l in range(N):
            a = new_list[l]
            num_list.append(a)
            actual_count += 1
        
    else:
        w = 1
        
print(actual_count)

Submission status: Wrong Answer

Solution code:
n = input()
l = [int(x) for x in 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: Wrong Answer

Solution code:
n = input()
l = input().split()
print(1)

Submission status: Wrong Answer

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

count = 0
temp = 0

for i in range(len(x)):
    temp += x[i]


while temp%2==0:
    temp = 0
    for i in range(len(x)):
        x[i] = int(x[i] / 2)
        temp += x[i]
    count+=1

print(count)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

two = [0] * n

for i in range(n):
        while a[i]%2 == 0 :
                two[i] += 1
                a[i] = a[i] / 2
print(two)
print(min(two))

Submission status: Wrong Answer

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

two = [0] * n

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import math

n = int(input())
a = map(int, input().split())
print(min([int(math.log2(an) // 1) for an in a]))

Submission status: Wrong Answer

Solution code:
n = int(input())
a = list(map(int, input().split()))
cnt = 0
cnt_2 = 0
i = 0
x = 0
y = 0

while True:
    while y < len(a):
        if a[y] % 2 == 0:
            print(a[y])
            a[y] = a[y]/2
            y += 1
        else:
            x = 1
            break
    if x == 1:
        break
    else:
        cnt_2 += 1
        y = 0

print(cnt_2)

Submission status: Wrong Answer

Solution code:
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)

Submission status: Wrong Answer

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

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

print(ans)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

t = True
x = -1

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)

Submission status: Wrong Answer

Solution code:
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)

Submission status: Wrong Answer

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: Wrong Answer

Solution code:
N = int(input())
A = list(map(int, input().split()))
ans = 0
def yo(n):
    return n%2
def waru(n):
    return int(n / 2)

for i in range(N):
    B = list(map(yo, A))
    if sum(B) == 0:
        A = list(map(waru, A))
        ans += 1

print(ans)

Submission status: Wrong Answer

Solution code:
N = int(input())
A = list(map(int, input().split()))
ans = 0
def yo(n):
    return n%2
def waru(n):
    return int(n / 2)

B = list(map(yo, A))

for i in range(N):
    if sum(B) == 0:
        A = list(map(waru, A))
        ans += 1

print(ans)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
N=int(input())
a=[int(x) for x in input().split()]
b=a
t=0
s=0
while s==0:
  for i in range(N):
    if b[i]%2!=0:
      s=1
    b[i]=b[i]/2
  t=t+1
    
print(t)

Submission status: Wrong Answer

Solution code:
N=int(input())
a=[int(x) for x in input().split()]
b=a
s=0
s=sum(b)
while s%2==0:
  for i in range(N):
    b[i]=b[i]/2
    s=s+1
print(s)

Submission status: Wrong Answer

Solution code:
N=int(input())
a=[int(x) for x in input().split()]
b=a
s=sum(b)
while s%2==0:
  for i in range(N):
    b[i]=b[i]/2

Submission status: Wrong Answer

Solution code:
n = int(input())
A = []
A = list(map(int, input().split()))
res = 0

while(True):
    flg_odd = 0
    for i in range(n):
        print(A[i])
        if ( A[i] % 2 != 0):
            flg_odd = 1
    if ( flg_odd == 1):
        break
    for i in range(n):
        A[i] = A[i]/2
    res += 1
print(res)

Submission status: Wrong Answer

Solution code:
import numpy as np

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

a = np.array(A)
cnt = 0

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

Submission status: Wrong Answer

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

cnt=0

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

Submission status: Wrong Answer

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

cnt=0

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

Submission status: Wrong Answer

Solution code:
n=int(input())
a=list(map(int, input().split()))
for i in range(30):
    x=2**i
    res=0
    for j in a:
        if j%x !=0:
            res=1
    if res==1:
        print(i-1)
        break

Submission status: Wrong Answer

Solution code:
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
            break
        else:
            dd[ind] = dd[ind] / 2
    if finish == 1:
        break
    else:
        nof_op += 1
print(nof_op)

Submission status: Wrong Answer

Solution code:
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)

Submission status: Wrong Answer

Solution code:
N = input()
Nums = list(map(int, input().split()))
max_divide_count = 0
while True:
    count_num_tmp = 0
    for num in Nums:
        if num % 2 != 0:
            break
    if count_num_tmp != len(Nums):
        break
    max_divide_count += 1

print(max_divide_count)

Submission status: Wrong Answer

Solution code:
# B-Shift only
def B_shift_only():

    try:
        # 正の整数の個数Nの入力
        N = input()

        # N個分の整数を入力
        Nums = list(map(int, input().split()))
    except EOFError:
        pass

    # 最大操作回数のカウント
    max_divide_count = 0
    while():
        count_num_tmp = 0
        for num in Nums:
            if num % 2 == 0:
                count_num_tmp = count_num_tmp + 1    
            else:
                break
    
        if Nums.len != count_num_tmp:
            break
        else:
            max_divide_count = max_divide_count + 1;

    # 最大結果出力
    print(max_divide_count)

if __name__ == "__main__":
    B_shift_only()

Submission status: Wrong Answer

Solution code:
n=int(input())
l=list(map(int,input().split()))
s=float('inf')
for a in l:
    c=0
    while 1:
        if a%2!=0:
            break
        a/=2
        c+=1
    s=min(s,c)
print(c)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:

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)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

def check_even(l):
    return sum([i % 2 for i in INPUT]) == 0

check_even(INPUT)

count = 0
while True:
    if check_even(INPUT):
        INPUT = [i / 2 for i in INPUT]
        count+=1
    else:
        break
print(count)

Submission status: Wrong Answer

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

f = True
for i in range(1, 30):
    for a in A:
        if a % 2**i != 0:
            f = False
    if not f:
        print(i-1)
        break

Submission status: Wrong Answer

Solution code:
N = int(input())
A = input().split(' ')
A = [int(A[i]) for i in range(N)]
count = 0
while count<10:
  for i in range(N):
    if A[i]%2 == 0:
      A[i] /= 2
    else:
      break
  else:
    count += 1
    continue
  break

print(count)

Submission status: Wrong Answer

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

Flg = True
COUNT  = 0

while(Flg):
    SUM = 0
    #print(A)
    for n in A:
        SUM+=n
    if SUM%2 != 0:
        Flg=False
    else:
        A =  [int(n / 2) for n in A]
        COUNT+=1

print(COUNT)

Submission status: Wrong Answer

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

count  = 3
num_list =[8,12,40]

output = 0
stop_flag = 0

while 1:
    for num in num_list:
        if((num % 2) == 1 ):
            stop_flag = 1
    if stop_flag == 0:
        output += 1
    
    num_list = list(map(lambda x: x/2,num_list))

    if stop_flag == 1:
        break
    
print(output)

Submission status: Wrong Answer

Solution code:
n = int(input())
a = list(map(int, input().split()))
s = sum(a)
ans = 0
while True:
  if s%2==0:
    s/=2
    ans+=1
  else:
    break
print(ans)

Submission status: Wrong Answer

Solution code:
n=int(input())

a_list=[int(i) for i in input().split()]
count_list=[]

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

print(count_list)   
print(min(count_list))

Submission status: Wrong Answer

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

count = 0
while(not(1 in A)):
    print(A)
    A = [i/2 if (i/2)%2==0 else 1 for i in A]
    count += 1
    
print(count)

Submission status: Wrong Answer

Solution code:
#!/usr/bin/env python3
n = int(input())
a = sorted(list(map(int,input().split())))

cnt = 0

for _ in range(1000000):
    if sum(a) % 2 == 1:
        break

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

    cnt += 1

print(cnt)

Submission status: Wrong Answer

Solution code:
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+1):
    if 0 not in list(map(odd_even_cal, array)):
        print(i)
        break
    array = list(map(cal, array))

else:
    print(i)

Submission status: Wrong Answer

Solution code:
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)
        break
    array = list(map(cal, array))

else:
    print(i)

Submission status: Wrong Answer

Solution code:
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)

Submission status: Wrong Answer

Solution code:
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 in list(map(odd_even_cal, array)):
        print(i + 1)
        break
    array = list(map(cal, array))
    print(array)

else:
    print(i + 1)

Submission status: Wrong Answer

Solution code:
n=int(input())
def f(x):
  x=int(x)
  cnt=0
  while x%2==0:
    cnt+=1
    x=x//2
  return cnt
a=list(map(f,input().split()))
print(max(a))

Submission status: Wrong Answer

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

judge_list = max([int(s)%2 for s in in_list])

if judge_list==1:
    print(0)
else:
    min_num = min([int(s) for s in in_list])
    amari = min_num%2
    counter = 0
    while amari == 0 :
        min_num = min_num/2
        amari = min_num%2
        counter += 1
    print(counter)

Submission status: Wrong Answer

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

count=0

while all(i/2==0 for i in l):
  l=[i/2 for i in l]
  count+=1
  
print(count)

Submission status: Wrong Answer

Solution code:
n = input()
max_ = 0
a = list(map(int, input().split()))
for e in a:
  c = 0
  while e % 2 == 0:
    c += 1
    e //= 2
  max_ = max(max_, c)
print(max_)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
N = int(input())
li = list(map(int, input().split()))
count = 0
def calc_half(n):
  return n/2
for i in range(N):
  for i in li:
    if i%2 == 0:
      flag = True
    else:
      flag = False
      break
  if flag == True:
    li = map(calc_half, li)
    count += 1
    
print(count)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
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)

Submission status: Wrong Answer

Solution code:
def division(li):
    for i in range(len(li)):
        if i % 2 == True:
            continue
        else:
            print(i)

division([8, 12, 40])

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

a = 0
count = 0
N = [0]*len(A)

for i in range(len(A)):
    if A[i] % 2 == 0:
        A[i] = A[i] / 2
        N[i] += 1

print(min(N))

Submission status: Wrong Answer

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

a = 0
count = 0
N = [0]*len(A)

for i in range(len(A)):
    if A[i] % 2 == 0:
        A[i] /= 2
        N[i] += 1

print(min(N))

Submission status: Wrong Answer

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

a = 0
count = 0
N = [0]*len(A)

for i in range(len(A)):
    if A[i] % 2 == 0:
        N[i] += 1


print(min(N))

Submission status: Wrong Answer

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

for i in range(n):
    if a[i]%2==1:
        print(0)
        exit()

b = min(a)
cnt = 0

while b%2==0:
    b//=2
    cnt+=1

print(cnt)

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

count=0
for i in range(min(A)):
   for ii in A:
      if ii % 2 != 0 :
         print(count)
         exit()

   count += 1
   A = [ii//(2*(i+1)) for ii in A ]

Submission status: Wrong Answer

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

count=0
for i in range(min(A)):
   count += 1
   for ii in [ii//(2*(i+1)) for ii in A ]:
      if ii % 2 != 0 :
         print(count)
         exit()