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: Time Limit Exceeded

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

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

    if T:
        break

    a = c
    count+=1


print(count)

Submission status: Time Limit Exceeded

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


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

    if T:
        break

    a = c
    count+=1


print(count)

Submission status: Time Limit Exceeded

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


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

    for i in range(len(a)):
        b = a[i] / 2
        c.append(b)
        
    a = c
    count+=1


print(count)

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

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

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

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

Solution code:
import sys

args = sys.argv

# print(args)

def f(arg_list):
    even_arg_list = []
    for i in arg_list:
        if i % 2 == 0:
            even_arg_list.append(i/2)
        else:
            return False
    return even_arg_list


counter = 0
_list = map(lambda x:int(x),args[1:])
while True:
    _list = f(_list)
    if _list == False:
        print(counter)
        sys.exit()
    counter+=1
    # print(_list)

Submission status: Time Limit Exceeded

Solution code:
import sys

args = sys.argv

print(args)

def f(arg_list):
    even_arg_list = []
    for i in arg_list:
        if i % 2 == 0:
            even_arg_list.append(i/2)
        else:
            return False
    return even_arg_list


counter = 0
_list = map(lambda x:int(x),args[1:])
while True:
    _list = f(_list)
    if _list == False:
        print(counter)
        sys.exit()
    counter+=1
    print(_list)

Submission status: Time Limit Exceeded

Solution code:

def main():
    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


if __name__ == "__main__":
    main()

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

Solution code:
N =int(input())
List = list(map(int, input().split()))
flag = True
res = 0
while flag:
  for i in range(N):
    if List[i] & 2 == 1:
      flag = False
      break
  if not flag:
    res += 1
print(res)

Submission status: Time Limit Exceeded

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:
            count_num_tmp = count_num_tmp + 1    
        else:
            break

    if len(Nums) != count_num_tmp:
        break
    else:
        max_divide_count = max_divide_count + 1
        
print(max_divide_count)

Submission status: Time Limit Exceeded

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

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

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

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

    # 最大結果出力
    print(max_divide_count)

if __name__ == "__main__":
    B_shift_only()

Submission status: Time Limit Exceeded

Solution code:
n=int(input())
flag=0
nums=list(map(int,input().split()))
cnt=0

while flag==0:
    for i in range(n):
        num=nums[0]/2
        key=nums[0]%2
        if key==1:
            flag==1
            break
        else:
            del nums[0]
            nums.append(num)
    if flag==0:
        cnt+=1
print(cnt)

Submission status: Time Limit Exceeded

Solution code:
def actual(N, A):
    count = 0

    while True:
        is_all_even = all([a % 2 == 0 for a in A])

        if is_all_even:
            A = [a // 2 for a in A]
            count += 1
        else:
            break

    return count

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

print(actual(N, A))

Submission status: Time Limit Exceeded

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

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

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

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

while K:
    for i in range(N):
        if A[i] % 2 ==1:
            K = False
        A[i] / 2

    if not K:
        break
    count += 1

print(count)

Submission status: Time Limit Exceeded

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

while K:
    for i in range(N):
        if A[i] % 2 ==1:
            K = False
        A[i] / 2

    if not K:
            break
    count += 1

print(count)

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

Solution code:
b=[]
a=input()
b=input().split()
ans=0
print(b)
while True:
 for s in b:
  if int(s)%2!=0:
   break
  else:
   s=int(s)/2
   ans+=1
print(ans)

Submission status: Time Limit Exceeded

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

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

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

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

while(all(i%2==0 for i in a)):
  list=[i/2 for i in a]
  cut+=1
print(cut)

Submission status: Time Limit Exceeded

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

#結果出力用
result = 0
#整数個数
count = 0
#整数の個数分計算
while count % n == 0 :
    #2で割り切れるかどうか
    for i in range(n):
        if list[i] % 2 == 0:
            #割り切れる場合個数を加算
            count += 1
            #割り切れる個数と元の数が同じ場合
            if count == n:
                #計算回数を加算
                result += 1
                #個数を初期化
                count = 0
                #整数を2で割った商をlistにして再計算
                for i in range(n):
                    list[i] = list[i] / 2

print(result)

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

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

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

Submission status: Time Limit Exceeded

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

while True:
    I = []
    count = 0
    for i in A:
        if i // 2 == 0:
            I.append(i)
            count += 1
        elif i//2 ==1:
            break

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

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

for i in range(10**10):
  for j in a:
    if j%2 != 0:
      print(count)
      exit()
  count += 1

Submission status: Time Limit Exceeded

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

while(a % 2 == 0 for a in li):
    li = [ a / 2 for a in li]
    count += 1
# a,b = map(int, input().split())
print(count)

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

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

count = 0
flag = True

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

print(count)

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

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

while True:
  flag = True # それぞれちゃんと２で割り切れるのか確認するためのフラグ

  for a in aList:
    if a % 2 != 0:
      flag = False
    a /= 2
   
  if flag == False:
    break

  count += 1

print(count)

Submission status: Time Limit Exceeded

Solution code:
import sys

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

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

main()

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

Solution code:
n=int(input())
a=list(map(int,input().split()))
n=0
while n>=0:
  if all(aa%2==0 for aa in a):
    for b in a:
      b=b//2
    n+=1
  else:
    break
print(n)

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

Solution code:
count = input()
numbers = map(int, input().split(' '))

counter = 0
while True:
  tmp = 0
  for item in numbers:
    tmp = tmp + item % 2
  if tmp > 0:
    break
  counter += 1
  numbers = [item / 2 for item in numbers]
print(counter)

Submission status: Time Limit Exceeded

Solution code:
count = int(input())
numbers = map(int, input().split(' '))

counter = 0
while True:
  tmp = 0
  for item in numbers:
    tmp += item % 2
  if tmp > 0:
    break
  counter += 1
  numbers = [item / 2 for item in numbers]

print(counter)

Submission status: Time Limit Exceeded

Solution code:
count = int(input())
numbers = map(int, input().split(' '))

counter = 0
while True:
  tmp = 0
  for item in numbers:
    tmp += item % 2
  if tmp > 0:
    break
  counter += 1
  numbers = [item / 2 for item in numbers]
  if numbers.count(0):
    break
print(counter)

Submission status: Time Limit Exceeded

Solution code:
count = int(input())
numbers = map(int, input().split(' '))

tmp = 0
counter = 0
while True:
  for item in numbers:
    tmp += item % 2
  if tmp > 0:
    break
  counter += 1
  numbers = [item / 2 for item in numbers]
  if numbers.count(0):
    break
print(counter)

Submission status: Time Limit Exceeded

Solution code:
count = int(input())
numbers = map(int, input().split(' '))

tmp = 0
counter = 0
while True:
  for item in numbers:
    if item > 0:
      tmp += item % 2
    else:
      break
  if tmp > 0:
    break
  counter += 1
  numbers = [item / 2 for item in numbers]

print(counter)

Submission status: Time Limit Exceeded

Solution code:
count = int(input())
numbers = map(int, input().split(' '))

tmp = 0
counter = 0
while True:
  for item in numbers:
    tmp += item % 2
  if tmp > 0:
    break
  counter += 1
  numbers = [item / 2 for item in numbers]

print(counter)

Submission status: Time Limit Exceeded

Solution code:
count = int(input())
numbers = map(int, input().split(' '))

counter = 0
while True:
  for item in numbers:
    if item % 2 == 1:
      break
  counter += 1
  numbers = [item / 2 for item in numbers]

print(counter)

Submission status: Time Limit Exceeded

Solution code:
count = int(input())
numbers = map(int, input().split(' '))

counter = 0
while True:
  for item in numbers:
    if item % 2 == 1:
      break
    else:
      counter += 1
  numbers = [item / 2 for item in numbers]

print(counter)

Submission status: Time Limit Exceeded

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

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

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

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

while True:
    #すべてが偶数か確認
    for i in range(N):
        if A[i] % 2 == 0:
            continue
        elif A[i]%2 == 1:
            break 

    for i in range(N):
        A[i] = A[i]/2
    n += 1


print(n)

Submission status: Time Limit Exceeded

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

while True:
    #すべてが偶数か確認
    for i in range(N):
        if A[i] % 2 == 0:
            continue
        else:
            break 

    for i in range(N):
        A[i] = A[i]/2
    n += 1


print(n)

Submission status: Time Limit Exceeded

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


while True:
    #すべてが偶数か確認
    for i in range(N):
        if A[i] % 2 == 0:
            continue
        else:
            break

    if A[i] % 2 == 0:
        A[i] = A[i]/2
        n += 1


print(n)

Submission status: Time Limit Exceeded

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

while can:
    for i in range(N):
        if A[i]%2 != 0:
            break

        if A[i]%2 == 0:         
            A[i] = A[i] // 2
            n += 1
        else:
            can = False
            break

print(n)

Submission status: Time Limit Exceeded

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

while can:
    for i in range(N):
        if A[i]%2 == 0:
            A[i] = (A[i]/2)
            n += 1
        else:
            break

print(n)

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

Solution code:
n = int(input())
a = input().split()
count = 0
for i in range(n-1):
    if int(a[i])%2 == 1:
        print(0)
        break

num = int(min(a))
while num != 1:
    num = num/2
    count += 1
print(count)

Submission status: Time Limit Exceeded

Solution code:
n = int(input())
a = input().split()
count = 0
for i in range(n-1):
    if int(a[i])%2 == 1:
        print(0)

num = int(min(a))
while num != 1:
    num = num/2
    count += 1
print(count)

Submission status: Time Limit Exceeded

Solution code:
# -*- coding: utf-8 -*-
 
N = int(input())
a = list(map(int, input().split(" ")))
c = []
 
for i in a:
  count = 0
  while not(i % 2):
    a = int(i / 2)
    count += 1
    c.append(count)
print(min(c))

Submission status: Time Limit Exceeded

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

while True:
    for x in A:
        if x % 2 == 1:
            break
        else:
            x /= 2
    i += 1

print(i)

Submission status: Time Limit Exceeded

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

cnt = 0

while(True):
  for idata in b:
    if ((idata % 2 ) == 0):
      continue
    else:
      break
      
print(cnt)

Submission status: Time Limit Exceeded

Solution code:
import math
import string


def readints():
    return list(map(int, input().split()))


def nCr(n, r):
    return math.factorial(n)//(math.factorial(n-r)*math.factorial(r))


def has_duplicates2(seq):
    seen = []
    for item in seq:
        if not(item in seen):
            seen.append(item)
    return len(seq) != len(seen)


def divisor(n):
    divisor = []
    for i in range(1, n+1):
        if n % i == 0:
            divisor.append(i)
    return divisor


# coordinates
dx = [-1, -1, -1, 0, 0, 1, 1, 1]
dy = [-1, 0, 1, -1, 1, -1, 0, 1]

n = int(input())
a = readints()


def func(a):
    cnt = 0
    for i in range(n):
        if a[i] % 2 == 0:
            cnt += 1
            a[i] = a[i]/2
    if cnt == n:
        return True
    else:
        False


cntcnt = 0
for _ in range(100000):
    if func(a):
        cntcnt += 1
print(cntcnt)

Submission status: Time Limit Exceeded

Solution code:
import sys
from math import sqrt

input = sys.stdin.readline


def I():
    return int(sys.stdin.readline())


def MI():
    return map(int, sys.stdin.readline().split())


inf = float("inf")
mod = 10 ** 9 + 7


def main():
    _ = I()
    a_list = MI()

    min = inf
    for a in a_list:
        c = 0
        while a % 2 == 0:
            c += 1

        if min > c:
            min = c

    print(min)
    pass


if __name__ == "__main__":
    main()

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

Solution code:
# 整数の入力
N = int(input())
# スペース区切りの整数の入力 リスト
A = list(map(int, input().split()))
count = 0


for j in range(1,100000000):
    odd_flag = True

    while odd_flag:
        for i in range(0,len(A)): #len(A)配列の要素数を整数値で返す
            if A[i] % 2 == 0:
                A[i] = A[i]/2
            else:
                odd_flag = False


count+=1


print(count)

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

Solution code:
n = input()
li = list(map(int, input().split()))
count = 0
while True:
    for x in li:
        if x % 2 == 1:
            break
        else:
            x = x / 2
    count += 1
print(count)

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

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

ans = 0
while True:
  for i in a_L:
    if i%2 != 0:
      print(ans)
      exit()
  ans += 1

Submission status: Time Limit Exceeded

Solution code:
from fractions import gcd

def gcds(List):
    __ = 0
    for _ in List:
        __ = gcd(__, _)
    return __

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

x = 0
y = gcds(l)

for i in range(y):
    if y % 2 ==0:
        x += 1
        y /= 2

print(x)

Submission status: Time Limit Exceeded

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

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

Submission status: Time Limit Exceeded

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

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

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

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

while True:
    if count(A, n):
        s += 1
    else:
        break
    
print(s)

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

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

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

Submission status: Time Limit Exceeded

Solution code:
n = input()
nums = map(int, input().split())
 
num_dvd = 0
 
can_devide = True
temp_list = []
while can_devide is True:
  for num in nums:
    if num % 2 == 1:
      print(num_dvd)
      can_devide == False
    else:
      temp_list.append(num // 2)
  num_dvd += 1
  nums, temp_list = temp_list, []

Submission status: Time Limit Exceeded

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

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

Submission status: Time Limit Exceeded

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

while True:
    c = [i for i in a if i % 2 == 0]
    if(len(c) != n):
        break
    else:
        cnt += 1
        continue
print(cnt)

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

Solution code:
n=int(input())

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

count=0

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

print(count)

Submission status: Time Limit Exceeded

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

count=0
cont=1

#print(a)
#print(a[2])

while cont :
  for i in range(len(a)) :
    #print("for")
    #print(a[i])
    if a[i]%2 == 0 :
      a_.append(a[i]/2)
    else :
      cont=0
      break
  if cont==1 :
    #print("cont")
    #print(count)
    a=a_
    count += 1
  else :
    break

print(count)

Submission status: Time Limit Exceeded

Solution code:
n = input()
list = list(map(int, input().split()))
count = 0
end = 0
while True:
  for i in range(len(list)):
    list[i] /= 2
    if not list[i].is_integer():
      end += 1
  if end == 1:
    break
  count += 1
print(count)

Submission status: Time Limit Exceeded

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

count = 0
while(1):
  if sum(lis) % 2 == 1:
    print(count)

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

Solution code:
input()
a = 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: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

Solution code:

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

Submission status: Time Limit Exceeded

Solution code:

n=input()
ans=0
i=0
b=list(map(int,input().split()))
print(b)
b=list(map(lambda x:x/2,b))
print(b)
while 1.0 or 0 not in b:
    b=list(map(lambda x:x/2,b))
    ans+=1
for x in b:
    if x%2==1:
        ans=0
print(ans)

Submission status: Time Limit Exceeded

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

while True:
	for s in A:
		if not s % 2 == 0:
  			break
	suc += 1
print(suc)

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

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