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: '''
    ____  _                             ____  _             _     
   / ___|(_)_ __ ___  _ __ __ _ _ __   / ___|(_)_ __   __ _| |__  
   \___ \| | '_ ` _ \| '__/ _` | '_ \  \___ \| | '_ \ / _` | '_ \ 
    ___) | | | | | | | | | (_| | | | |  ___) | | | | | (_| | | | |
   |____/|_|_| |_| |_|_|  \__,_|_| |_| |____/|_|_| |_|\__, |_| |_|
                                                      |___/     
    Time: 2021-09-12 20:08:05  
  '''
  from collections import Counter, deque, defaultdict
  from heapq import *
  import math 
  
  def inp():
    return int(input())
  
  def mapInput():
    return map(int, input().split())
  
  def arrInput():
    return list(map(int, input().split()))
  
  def task():
    s = input()
    c = defaultdict(int)
    n = len(s)
    for x in s:
      c[x] += 1
    if c["1"] == n:
      return 0
    if c["0"] == n:
      return 1
    zCount = 0
    for x in s: 
      if x == "0":
        zCount += 1
      elif zCount > 0:
        if zCount == c["0"]:
          return 1
        return 2
    return 1
  
  for _ in range(inp()):
    print(task())