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 codeforces;
  import java.io.BufferedReader;
  import java.math.*;
  
  
  import java.io.IOException;
  import java.io.InputStreamReader;
  import java.math.BigInteger;
  import java.util.*;
  import static java.util.Arrays.sort;
  import static java.lang.System.out;
  import static java.util.Collections.*;
  
  public class cf
  {
  	final static String no = "NO";
  	final static String yes = "YES";	
  	//static int flag = 0;
  	static int count = 0;
  	
  	public static void main(String[]args) {
  		FastScanner sc = new FastScanner();
  		int t = sc.nextInt();
  		while(t-->0) {
  			String str = sc.next();
  			int cnt = 0;
  			for(int i =0;i<str.length();i++) {
  				if(str.charAt(i)=='0') {
  					while(i<str.length() && str.charAt(i)=='0') {
  						i++;
  					}
  					cnt++;
  				}
  			}
  			if(cnt==0) {
  				System.out.println(0);
  			}else if(cnt==1) {
  				System.out.println(1);
  			}else {
  				System.out.println(Math.min(2, cnt));
  			}
  			
  		}
  		
  	}
  	public static List<Integer> solve(int X, List<Integer> arr, List<Integer> query_values){
  		List<Integer> ls = new ArrayList<>();
  		
  		int[]a = new int[arr.size()];
  		int k =0;
  		for(int i =0;i<a.length;i++) {
  			if(arr.get(i)==X) {
  				a[k++] = i;
  			}
  		}
  		for(Integer x : query_values) {
  			if(x<arr.size()&&a[x-1]!=0) {
  				
  				ls.add(a[x-1]);
  			}
  		}
  		return ls;
  	}
  	static int go(int[]arr,int[]sorted) {
  		sorted = arr;
  		Arrays.sort(sorted);
  		int count = 0;
  		//int change = 0;
  		do {
  			//change = 0;
  			for(int i =0;i<arr.length-1;i+=2) {
  				if(arr[i]>arr[i+1]) {
  					int temp = arr[i];
  					arr[i] = arr[i+1];
  					arr[i+1] = temp;
  					count++;
  				}
  			}
  			//if(change==0) {
  				for(int i =1;i<arr.length-2;i+=2) {
  					if(arr[i]>arr[i+1]) {
  						int temp = arr[i];
  						arr[i] = arr[i+1];
  						arr[i+1] = temp;
  						count++;
  					}
  				}
  				
  			//}
  		}while(Arrays.equals(sorted, arr));
  		return count;
  	}
  	static int[] countInversions(int[]arr,int low,int high){
  		if(low==high) {
  			int base[] = new int[1];
  			base[0] = arr[low];
  			return base;
  		}
  		int mid = low+(high-low)/2;
  		int left[] = countInversions(arr,low,mid);
  		int right[] = countInversions(arr,mid+1,high);
  		int[]merged = merge(left,right);
  		return merged;
  	}
  	
  	static int[] merge(int first[], int[]next) {
  		
  		int i = 0;
  		int j = 0;
  		int k = 0;
  		int[]merged = new int[first.length+next.length];
  		while(j<first.length && k<next.length) {
  			if(first[j]<=next[k]) {
  				merged[i++] = first[j++];
  			}else {
  				merged[i++] = next[k++];
  				//count += first.length -j;
  			}
  		}
  		while(j<first.length) {
  			merged[i++] = first[j++];
  		}
  		while(k<next.length) {
  			merged[i++] = next[k++];
  		}
  		
  		return merged;
  	}
  	static class FastScanner {
  		BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
  		StringTokenizer st=new StringTokenizer("");
  		String next() {
  			while (!st.hasMoreTokens())
  				try {
  					st=new StringTokenizer(br.readLine());
  				} catch (IOException e) {
  					e.printStackTrace();
  				}
  			return st.nextToken();
  		}
  		
  		int nextInt() {
  			return Integer.parseInt(next());
  		}
  		int [] readArray(int n) {
  			int[] a=new int[n];
  			for (int i=0; i<n; i++) a[i]=nextInt();
  			return a;
  		}
  		long nextLong() {
  			return Long.parseLong(next());
  		}
  		long [] longArray(int n) {
  			long[] a=new long[n];
  			for(int i=0 ; i<n ; i++) a[i]=nextLong();
  			return a;
  		}
  		double nextDouble() {
  			return Double.parseDouble(next());
  		}
  	}
  
  
  }
  
  