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.*;
  import java.lang.reflect.Array;
  import java.util.*;
  
  public class Main {
      // final CustomReader in = new CustomReader("input.txt");
      final CustomReader in = new CustomReader();
      final PrintWriter out = new PrintWriter(System.out);
  
      void solve() {
          int t = in.nextInt();
          while (t-- > 0) {
              String s = in.nextLine();
  
              TreeSet<Integer> zeroLocations = new TreeSet<>();
              for (int i = 0; i < s.length(); i++) {
                  if (s.charAt(i) == '1') {
  
                  } else {
                      zeroLocations.add(i);
                  }
              }
  
              if (zeroLocations.size() == s.length()) {
                  out.println(1);
              } else if (zeroLocations.size() == 0) {
                  out.println(0);
              } else {
                  boolean lol = false;
                  int prev = -1;
                  for (int index : zeroLocations) {
                      if (prev == -1) {
                          prev = index;
                      } else {
                          if (index - 1 != prev) {
                              lol = true;
                              out.println(2);
                              break;
                          }
                          prev = index;
                      }
                  }
                  if (!lol) {
                      out.println(1);
                  }
              }
          }
      }
  
      public static void main(String[] args) { Main s = new Main(); s.solve(); s.out.close(); }
  
      private static class CustomReader {
          private final InputStream stream;
          private final byte[] buf = new byte[8192];
          private int curChar;
          private int numChars;
  
          CustomReader() {
              stream = System.in;
          }
  
          CustomReader(String fileName) {
              InputStream temp = null;
              try {
                  temp = new FileInputStream(fileName);
              } catch (FileNotFoundException e) {
                  e.printStackTrace();
              }
              stream = temp;
          }
  
          String nextLine() {
              int c = read();
              StringBuilder res = new StringBuilder();
              while (!isEndOfLine(c)) {
                  res.appendCodePoint(c);
                  c = read();
              }
              if (c == '\r') read();
              return res.toString();
          }
  
          String nextString() {
              int c = read();
              while (isSpaceChar(c)) c = read();
              StringBuilder res = new StringBuilder();
              while (!isSpaceChar(c)) {
                  res.appendCodePoint(c);
                  c = read();
              }
              if (c == '\r') read();
              return res.toString();
          }
  
          long nextLong() {
              int c = read();
              while (isSpaceChar(c)) c = read();
              int sgn = 1;
              if (c == '-') {
                  sgn = -1;
                  c = read();
              }
              long res = 0;
              while (!isSpaceChar(c)) {
                  if (c < '0' || c > '9') throw new InputMismatchException();
                  res *= 10;
                  res += c - '0';
                  c = read();
              }
              if (c == '\r') read();
              return res * sgn;
          }
  
          int nextInt() {
              int c = read();
              while (isSpaceChar(c)) c = read();
              int sgn = 1;
              if (c == '-') {
                  sgn = -1;
                  c = read();
              }
              int res = 0;
              while (!isSpaceChar(c)) {
                  if (c < '0' || c > '9') throw new InputMismatchException();
                  res *= 10;
                  res += c - '0';
                  c = read();
              }
              if (c == '\r') read();
              return res * sgn;
          }
  
          int[] nextArray(int n) {
              int[] arr = new int[n];
              for (int i = 0; i < n; i++) arr[i] = nextInt();
              return arr;
          }
  
          double nextDouble() {
              return Double.parseDouble(nextString());
          }
  
          boolean hasNext() {
              if (numChars == -1) return false;
              return curChar < numChars || curChar == buf.length || numChars == 0; // Probably
          }
  
          private int read() {
              if (numChars == -1) throw new InputMismatchException();
              if (curChar >= numChars) {
                  curChar = 0;
                  try {
                      numChars = stream.read(buf);
                  } catch (IOException e) {
                      throw new InputMismatchException();
                  }
                  if (numChars <= 0) return -1;
              }
              return buf[curChar++];
          }
  
          private static boolean isSpaceChar(int c) {
              return c == ' ' || c == '\n' || c == '\r' || c == '\t' || c == -1;
          }
  
          private static boolean isEndOfLine(int c) {
              return c == '\n' || c == '\r' || c == -1;
          }
      }
  }
  