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.io.BufferedReader;
  import java.io.File;
  import java.io.FileReader;
  import java.io.IOException;
  import java.io.InputStreamReader;
  import java.io.PrintWriter;
  import java.util.ArrayList;
  import java.util.Arrays;
  import java.util.Collections;
  import java.util.StringTokenizer;
  
  public class Main {
      static int mod = 1000_000_007;
      static long mod1 = 998244353;
      static boolean memory = false;
      static FastScanner f;
      static PrintWriter pw;
      static double eps = 1e-6;
      static int oo = (int) 1e9;
  
      public static void solve() throws Exception {
          // Add your code here
          char s[] = f.next().toCharArray();
          int cnt0 = 0 , cnt1 = 0;
          for (char c : s) {
              if (c == '0') ++cnt0;
              else ++cnt1;
          }
          if (cnt0 == 0) {
              pn(0);
          }
          else if (cnt1 == 0) {
              pn(1);
          }
          else {
              int p = -1;
              boolean ok = true;
              int i = 0;
              ArrayList<Integer> a = new ArrayList<>();
              for (char c : s) {
                  i++;
                  if (c == '1') continue;
                  a.add(i);
              }
              for (i = 1; i < a.size(); ++i) ok &= a.get(i) - a.get(i - 1) == 1;
              if (ok) pn(1);
              else pn(2);
          }
      }
  
      public static void main(String[] args) throws Exception {
          if (memory)
              new Thread(null, new Runnable() {
                  public void run() {
                      try {
                          new Main().run();
                      } catch (Exception e) {
                          e.printStackTrace();
                          System.exit(1);
                      }
                  }
              }, "", 1 << 28).start();
          else
              new Main().run();
      }
  
      void run() throws Exception {
          if (System.getProperty("ONLINE_JUDGE") == null) {
              f = new FastScanner("");
              File file = new File("!out.txt");
              pw = new PrintWriter(file);
          } else {
              f = new FastScanner();
              pw = new PrintWriter(System.out);
          }
  
          int t = f.ni();
          int tt = 1;
          while (t-- > 0) {
              // p("Case #" + (tt++) + ": ");
              solve();
          }
  
          pw.flush();
          pw.close();
      }
  
      public static class FastScanner {
          BufferedReader br;
          StringTokenizer st;
  
          public FastScanner(String str) throws Exception {
              try {
                  br = new BufferedReader(new FileReader("!a.txt"));
              } catch (Exception e) {
                  e.printStackTrace();
              }
          }
  
          public FastScanner() {
              br = new BufferedReader(new InputStreamReader(System.in));
          }
  
          public String next() throws IOException {
              while (st == null || !st.hasMoreTokens())
                  st = new StringTokenizer(br.readLine());
              return st.nextToken();
          }
  
          public int ni() throws IOException {
              return Integer.parseInt(next());
          }
  
          public long nl() throws IOException {
              return Long.parseLong(next());
          }
  
          public String nextLine() throws IOException {
              return br.readLine();
          }
  
          public double nd() throws IOException {
              return Double.parseDouble(next());
          }
  
      }
  
      public static void pn(Object... o) {
          for (int i = 0; i < o.length; ++i)
              pw.print(o[i] + (i + 1 < o.length ? " " : "\n"));
      }
  
      public static void p(Object... o) {
          for (int i = 0; i < o.length; ++i)
              pw.print(o[i] + (i + 1 < o.length ? " " : ""));
      }
  
      public static void pni(Object... o) {
          for (Object obj : o)
              pw.print(obj + " ");
          pw.println();
          pw.flush();
      }
  
      public static void sort(int[] a) {
          ArrayList<Integer> l = new ArrayList<>();
          for (int i : a)
              l.add(i);
          Collections.sort(l);
          for (int i = 0; i < a.length; ++i)
              a[i] = l.get(i);
      }
  
      public static void sort(long[] a) {
          ArrayList<Long> l = new ArrayList<>();
          for (long i : a)
              l.add(i);
          Collections.sort(l);
          for (int i = 0; i < a.length; ++i)
              a[i] = l.get(i);
      }
  }