description: A binary string is a string that consists of characters 0 and 1.
  
  Let \operatorname{MEX} of a binary string be the smallest digit among 0, 1, or 2 that does not occur in the string. For example, \operatorname{MEX} of 001011 is 2, because 0 and 1 occur in the string at least once, \operatorname{MEX} of 1111 is 0, because 0 and 2 do not occur in the string and 0 < 2.
  
  A binary string s is given. You should cut it into any number of substrings such that each character is in exactly one substring. It is possible to cut the string into a single substring — the whole string.
  
  A string a is a substring of a string b if a can be obtained from b by deletion of several (possibly, zero or all) characters from the beginning and several (possibly, zero or all) characters from the end.
  
  What is the minimal sum of \operatorname{MEX} of all substrings pieces can be?
  
  Input
  
  The input consists of multiple test cases. The first line contains a single integer t (1 ≤ t ≤ 10^4) — the number of test cases. Description of the test cases follows.
  
  Each test case contains a single binary string s (1 ≤ |s| ≤ 10^5).
  
  It's guaranteed that the sum of lengths of s over all test cases does not exceed 10^5.
  
  Output
  
  For each test case print a single integer — the minimal sum of \operatorname{MEX} of all substrings that it is possible to get by cutting s optimally.
  
  Example
  
  Input
  
  
  6
  01
  1111
  01100
  101
  0000
  01010
  
  
  Output
  
  
  1
  0
  2
  1
  1
  2
  
  Note
  
  In the first test case the minimal sum is \operatorname{MEX}(0) + \operatorname{MEX}(1) = 1 + 0 = 1.
  
  In the second test case the minimal sum is \operatorname{MEX}(1111) = 0.
  
  In the third test case the minimal sum is \operatorname{MEX}(01100) = 2.
solution: #----------FASTIOSTART-----------#
  from __future__ import division, print_function
  import os
  import sys
  from io import BytesIO, IOBase
  if sys.version_info[0] < 3:
  	from __builtin__ import xrange as range
  	from future_builtins import ascii, filter, hex, map, oct, zip
  BUFSIZE = 8192
  class FastIO(IOBase):
  	newlines = 0
  	def __init__(self, file):
  		self._fd = file.fileno()
  		self.buffer = BytesIO()
  		self.writable = "x" in file.mode or "r" not in file.mode
  		self.write = self.buffer.write if self.writable else None
  	def read(self):
  		while True:
  			b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
  			if not b:
  				break
  			ptr = self.buffer.tell()
  			self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
  		self.newlines = 0
  		return self.buffer.read()
  	def readline(self):
  		while self.newlines == 0:
  			b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
  			self.newlines = b.count(b"\n") + (not b)
  			ptr = self.buffer.tell()
  			self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
  		self.newlines -= 1
  		return self.buffer.readline()
  	def flush(self):
  		if self.writable:
  			os.write(self._fd, self.buffer.getvalue())
  			self.buffer.truncate(0), self.buffer.seek(0)
  class IOWrapper(IOBase):
  	def __init__(self, file):
  		self.buffer = FastIO(file)
  		self.flush = self.buffer.flush
  		self.writable = self.buffer.writable
  		self.write = lambda s: self.buffer.write(s.encode("ascii"))
  		self.read = lambda: self.buffer.read().decode("ascii")
  		self.readline = lambda: self.buffer.readline().decode("ascii")
  def print(*args, **kwargs):
  	sep, file = kwargs.pop("sep", " "), kwargs.pop("file", sys.stdout)
  	at_start = True
  	for x in args:
  		if not at_start:
  			file.write(sep)
  		file.write(str(x))
  		at_start = False
  	file.write(kwargs.pop("end", "\n"))
  	if kwargs.pop("flush", False):
  		file.flush()
  if sys.version_info[0] < 3:
  	sys.stdin, sys.stdout = FastIO(sys.stdin), FastIO(sys.stdout)
  else:
  	sys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)
  input = lambda: sys.stdin.readline().rstrip("\r\n")
  #----------FASTIOFINISH----------#
  import collections,string,bisect,re,random,queue,itertools,statistics,math
  from collections import *
  from bisect import *
  from string import *
  from itertools import * 
  from statistics import *
  from math import *
  from re import *
  from queue import *
  #----------SASTA_STL-------------#
  # stack
  class Stack:
      def __init__(self):self.items = []
      def push(self, item):self.items.append(item)
      def pop(self):return self.items.pop()
      def empty(self):return self.items == []
      def size(self):return len(self.items)
      def at(self,idx):
      	try:return self.items[idx]
      	except:return -1
  #priority_queue
  class priority_queue(object):
      def __init__(self):self.queue = []
      def __str__(self):return ' '.join([str(i) for i in self.queue])
      def empty(self):return len(self.queue) == 0
      def push(self, data):self.queue.append(data)
      def pop(self):
          try:
              max = 0
              for i in range(len(self.queue)):
                  if self.queue[i] > self.queue[max]:
                      max = i
              item = self.queue[max]
              del self.queue[max]
              return item
          except IndexError:
              print()
              exit()
  #----------SASTA_STL-------------#
  mod  = int(1e9+7)
  imax = float("inf")
  imin = float("-inf")
  true = True
  false= False
  N 	 = int(1e5+10)
  none = None
  inp = lambda : input()
  I   = lambda : int(inp())
  M   = lambda : map(int,inp().split())
  MS  = lambda : map(str,inp().split())
  S   = lambda : list(MS())
  L   = lambda : list(M())
  def IO():
  	try:sys.stdin = open('input.txt', 'r');sys.stdout = open('uttar.txt', 'w')
  	except:pass
  IO()
  #----------TOTKA-----------#
  
  def kabraji_ka_totka():
  	# totka hai dosto !
  	s=inp()
  	if not s.count("0"):
  		print(0)
  		return
  	if s.rfind("0") - s.find("0") + 1 == s.count("0"):
  		print(1)
  		return
  	print(2)
  
  #----------TOTKA----------#
  if __name__ == '__main__':
  	for i in range(I()):
  		#print("Case #"+str(i+1)+": ")
  		kabraji_ka_totka()