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: import java.util.*;
  import java.io.*;
  import java.io.BufferedReader;
  import java.io.IOException;
  import java.io.InputStreamReader;
  import java.util.Scanner;
  import java.util.StringTokenizer;
  
  public class Test{
  
          static FastReader scan;
  
          static void solve(){
              String str=scan.next();
              int count=0;
              for(char ch:str.toCharArray()){
                  if(ch=='0')count++;
              }
              if(count==0){
                  System.out.println(0);
                  return;
              }
              
              if(count==str.length()){
                  System.out.println(1);
                  return;
              }
              count=0;
              for(int i=0;i<str.length();i++){
                  if(str.charAt(i)=='0'){
                      count++;
                      while(i<str.length()&&str.charAt(i)=='0')i++;
                      i--;
                  }
              }
              if(count<=2)System.out.println(count);
              else System.out.println(2);
  
          }
  
          public static void main (String[] args) throws java.lang.Exception{
              scan=new FastReader();
              int t=scan.nextInt();
              while(t-->0){
                  solve();
              }
          }
  
          static class FastReader {
              BufferedReader br;
              StringTokenizer st;
  
              public FastReader()
              {
                  br = new BufferedReader(
                      new InputStreamReader(System.in));
              }
  
              String next()
              {
                  while (st == null || !st.hasMoreElements()) {
                      try {
                          st = new StringTokenizer(br.readLine());
                      }
                      catch (IOException e) {
                          e.printStackTrace();
                      }
                  }
                  return st.nextToken();
              }
  
              int nextInt() { return Integer.parseInt(next()); }
  
              long nextLong() { return Long.parseLong(next()); }
  
              double nextDouble() { return Double.parseDouble(next()); }
  
              String nextLine()
              {
                  String str = "";
                  try {
                      str = br.readLine();
                  }
                  catch (IOException e) {
                      e.printStackTrace();
                  }
                  return str;
              }
          }
  
          static class Pair implements Comparable<Pair>{
              long wt;
              long idx;
              Pair(long x,long y){
                  this.wt=x;
                  this.idx=y;
              }
              @Override
              public int compareTo(Pair x){
                  return (int)(this.wt-x.wt);
              }
  
              public String toString(){
                  return "( "+wt+" "+idx+" )";
              }
          }        
  
          static void printLong(long []arr){
              for(long x:arr)System.out.print(x+" ");
          }
  
          static void printInt(int []arr){
              for(int x:arr)System.out.print(x+" ");
          }
  
          static void scanInt(int []arr){
              for(int i=0;i<arr.length;i++){
                  arr[i]=scan.nextInt();
              }
          }
  
          static void scanLong(long []arr){
              for(int i=0;i<arr.length;i++){
                  arr[i]=scan.nextLong();
              }
          }
  
          static long gcd(long a, long b){
              if (b == 0)
                  return a;
              
              return gcd(b, a % b);
          }   
  
          static long power(long x, long y, long mod){
              long res = 1; 
          
              x = x % mod; 
           
              if (x == 0)
                return 0; 
           
              while (y > 0){              
                  if ((y & 1) != 0)
                  res = (res * x) % mod;
                
                  y = y >> 1; 
                  x = (x * x) % mod;
              }
                  return res;
          }
  
          static long add(long a,long b,long mod){
              a = a % mod; 
              b = b % mod; 
              return (((a + b) % mod) + mod) % mod;
          }
  
          static long sub(long a, long b,long mod){
              a = a % mod; 
              b = b % mod; 
              return (((a - b) % mod) + mod) % mod;
          }
  
          static long mul(long a, long b,long mod){
              a = a % mod; 
              b = b % mod; 
              return (((a * b) % mod) + mod) % mod;
          }
          
  
          static long mminvprime(long a, long b,long mod) {
              return power(a, b - 2,mod);
          }
  }
  