output_description: Print the maximum possible number of operations that Snuke can perform.
  
  * * *
input_description: Input is given from Standard Input in the following format:
  
      
      
      N
      A_1 A_2 ... A_N
attempt: import math
  n = input()
  a = list(map(int, input().split()))
  ans = float("inf")
  for _ in a:
      ans = min(len(bin(_) - bin(_).rfind("1") - 1)
  print(round(ans))
problem_description: 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.
samples: [{"input": "3\n    8 12 40", "output": "2\n    \n\nInitially, [8, 12, 40] are written on the blackboard. Since all those integers\nare even, Snuke can perform the operation.\n\nAfter the operation is performed once, [4, 6, 20] are written on the\nblackboard. Since all those integers are again even, he can perform the\noperation.\n\nAfter the operation is performed twice, [2, 3, 10] are written on the\nblackboard. Now, there is an odd number 3 on the blackboard, so he cannot\nperform the operation any more.\n\nThus, Snuke can perform the operation at most twice.\n\n* * *"}, {"input": "4\n    5 6 8 10", "output": "0\n    \n\nSince there is an odd number 5 on the blackboard already in the beginning,\nSnuke cannot perform the operation at all.\n\n* * *"}, {"input": "6\n    382253568 723152896 37802240 379425024 404894720 471526144", "output": "8"}]