output_description: Print the answer.
  
  * * *
input_description: Input is given from Standard Input in the following format:
  
      
      
      s_{1}s_{2}s_{3}
attempt: iter_num = input()
  variables = input()
  
  raw_variables = variables.split(" ")
  variables = list()
  
  for raw_variable in raw_variables:
      variables.append(int(raw_variable))
  
  
  def calc(variable):
      process_count = 0
      while variable % 2 == 0:
          process_count += 1
          variable = variable / 2
      return process_count
  
  
  min_count = None
  
  for variable in variables:
      process_count = calc(variable)
      if min_count is None:
          min_count = process_count
      if process_count < min_count:
          min_count = process_count
  
  print(min_count)
  
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."}]