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 MyPackage;
  import java.io.*;
  import java.util.*;
  public class MyClass {
      final static int mod = 998_244_353;
      final static int mini = Integer.MIN_VALUE;
      final static int maxi = Integer.MAX_VALUE;
      static long gcd(long a, long b) {
          if (b == 0) return a;
          return gcd(b, a % b);
      }
      static long ncr(long n, long r) {
          if (r > n - r) r = n - r;
          long[] C = new long[(int) r + 1];
          C[0] = 1;
          for (int i = 1; i <= n; i++) {
              for (long j = Math.min(i, r); j > 0; j--)
                  C[(int) j] = (C[(int) j] + C[(int) j - 1]) % mod;
          }
          return C[(int) r];
      }
      static boolean isPrime(long n) {
          if (n <= 1)
              return false;
          else if (n == 2)
              return true;
          else if (n % 2 == 0)
              return false;
          for (int i = 3; i <= Math.sqrt(n); i += 2) {
              if (n % i == 0)
                  return false;
          }
          return true;
      }
      static boolean isPalindrome(String s) {
          int i = 0, j = s.length() - 1;
          while(i < j) {
              if(s.charAt(i) != s.charAt(j)) return false;
              i++;
              j--;
          }
          return true;
      }
      static long lcm(long a, long b) {
          return (a / gcd(a, b)) * b;
      }
      static void sort(long[] a) {
          ArrayList<Long> l = new ArrayList<>();
          for (long value : a) {
              l.add(value);
          }
          Collections.sort(l);
          for (int i = 0; i < l.size(); i++)
              a[i] = l.get(i);
      }
      static int ceil(int a, int b) {
          return a % b == 0 ? a / b : a / b + 1;
      }
      static void sort(int[] a) {
          ArrayList<Integer> l = new ArrayList<>();
          for (int value : a) {
              l.add(value);
          }
          Collections.sort(l);
          for (int i = 0; i < l.size(); i++)
              a[i] = l.get(i);
      }
      static void reverse(int[] arr) {
          int l = 0;
          int h = arr.length - 1;
          while (l < h) {
              swap(arr, l, h);
              l++;
              h--;
          }
      }
      static String reverse(String s) {
          StringBuilder res = new StringBuilder(s);
          return res.reverse().toString();
      }
      static void swap(int[] arr, int i, int j) {
          int temp = arr[i];
          arr[i] = arr[j];
          arr[j] = temp;
      }
      static class FastReader {
          BufferedReader br;
          StringTokenizer st;
  
          public FastReader() {
              br = new BufferedReader(new InputStreamReader(System.in));
          }
  
          String n() {
              while (st == null || !st.hasMoreElements()) {
                  try {
                      st = new StringTokenizer(br.readLine());
                  } catch (IOException e) {
                      e.printStackTrace();
                  }
              }
              return st.nextToken();
          }
  
          int nint() {
              return Integer.parseInt(n());
          }
  
          long nlong() {
              return Long.parseLong(n());
          }
  
          double ndouble() {
              return Double.parseDouble(n());
          }
  
          int[] narr(int n) {
              int[] a = new int[n];
              for (int i = 0; i < n; i++) a[i] = nint();
              return a;
          }
          int[][] narr(int n, int m) {
              int[][] a = new int[n][m];
              for (int i = 0; i < n; i++)
                  for (int j = 0; j < m; j++)
                      a[i][j] = nint();
              return a;
          }
  
          String nline() {
              String str = "";
              try {
                  str = br.readLine();
              } catch (IOException e) {
                  e.printStackTrace();
              }
              return str;
          }
      }
      public static void main(String[] args) {
          FastReader sc = new FastReader();
          PrintWriter out = new PrintWriter(System.out);
          // int t = 1;
          int t = sc.nint();
          while(t-- > 0) {
              char[] arr = sc.n().toCharArray();
              int o = 0, z = 0;
              for(char c : arr) {
                  if(c == '0') z++;
                  else o++;
              }
              if(z == 0) out.println(0);
              else if(o == 0) out.println(1);
              else {
                  int n = arr.length;
                  int change = 0;
                  for(int i = 0; i < n - 1; i++) {
                      if(arr[i] != arr[i + 1]) change++;
                  }
                  if(change < 2) out.println(1);
                  else if(change == 2 && arr[0] == '0') out.println(2);
                  else if(change == 2 && arr[0] == '1') out.println(1);
                  else out.println(2);
              }
          }
          out.flush();
          out.close();
      }
  }