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: //package com.company;
  import javax.swing.*;
  import java.util.*;
  import java.io.*;
  public class Main  {
      static FastReader in=new FastReader();
      static final Random random=new Random();
      static long mod=1000000007L;
      static HashMap<Character,Integer>map=new HashMap<>();
      static HashMap<Integer,Integer>ans=new HashMap<>();
      static Set<Integer> chr= new HashSet<>();
      static Set<Integer> chr1= new HashSet<>();
      static ArrayList<Integer> arl = new ArrayList<>();
      static ArrayList<Integer> arl1 = new ArrayList<>();
      static ArrayList<Integer> arl2= new ArrayList<>();
      static  final int N=(int)1e6+1;
      static int [] freq= new int[1000005];
      public static void main(String args[]) throws IOException {
          StringBuilder res = new StringBuilder();
          int t =in.nextInt();
          while(t-->0){
              char [] ch = in.next().toCharArray();
              boolean bool= false;
              int cnt=0;
              for(char c :ch) {
                  if (c == '0') {
                      bool =true;
                  }
              }
              if(ch[0]=='0') cnt++;
              for(int i =1;i<ch.length;i++){
                  if(ch[i]=='0' &&ch[i-1]=='1'){
                      cnt++;
                  }
              }
              if(!bool)
                  System.out.println(0);
              else if(cnt==1)
                  System.out.println(1);
              else{
                  System.out.println(2);
              }
          }
  
      }
      static int max(int a, int b)
      {
          if(a<b)
              return b;
          return a;
      }
      static void ruffleSort(int[] a) {
          int n=a.length;
          for (int i=0; i<n; i++) {
              int oi=random.nextInt(n), temp=a[oi];
              a[oi]=a[i]; a[i]=temp;
          }
          Arrays.sort(a);
      }
  
      static < E > void print(E res)
      {
          System.out.println(res);
      }
  
  
      static  int gcd(int a,int b)
      {
          if(b==0)
          {
              return a;
          }
          return gcd(b,a%b);
      }
  
      static int lcm(int a, int b)
      {
          return (a / gcd(a, b)) * b;
      }
  
  
      static int abs(int a)
      {
          if(a<0)
              return -1*a;
          return a;
      }
  
      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;
          }
  
          int [] readIntArray(int n) {
              int res [] = new int [n];
              for(int i = 0; i<n; i++)res[i] = nextInt();
              return res;
          }
          long [] readLongArray(int n) {
              long res [] = new long [n];
              for(int i = 0; i<n; i++)res[i] = nextLong();
              return res;
          }
      }
  
  }