output_description: Print the answer.
  
  * * *
input_description: Input is given from Standard Input in the following format:
  
      
      
      s_{1}s_{2}s_{3}
attempt: # coding: utf-8
  
  N = input()
  array1 = input().split()
  #array2 = int(array1)
  array = list(array1)
  chk = 0
  
  if (int(array[0])%2) != 0:
  	print("0")
  else:
  	flg = 0
  	mini1 = min(array)
  	mini = int(mini1)
  	while 1:
  		mini = mini/2
  		flg +=1
  		if mini%2 !== 0:
  			break
  
  	print(flg)
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."}]