output_description: Print the answer.
  
  * * *
input_description: Input is given from Standard Input in the following format:
  
      
      
      s_{1}s_{2}s_{3}
attempt: input()
  nums = input().split()
  result = 18  # 制約 Ai < 10^9より
  for num in nums:
      num = int(num)
      div_times = 0
      while (num & 1) == 0:
          num = num >> 1
          div_times += 1
      if div_times < result:
          result = div_times
  print(result)
  
problem_description: Statement
  
  Snuke has a grid consisting of three squares numbered 1, 2 and 3. In each
  square, either `0` or `1` is written. The number written in Square i is s_i.
  
  Snuke will place a marble on each square that says `1`. Find the number of
  squares on which Snuke will place a marble.
samples: [{"input": "101", "output": "2\n    \n\n  * A marble will be placed on Square 1 and 3.\n\n* * *"}, {"input": "000", "output": "0\n    \n\n  * No marble will be placed on any square."}]