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.DataInputStream;
  import java.io.FileInputStream;
  import java.io.IOException;
  import java.util.AbstractMap;
  import java.util.Comparator;
  import java.util.HashMap;
  import java.util.Map;
  import java.util.Map.Entry;
  import java.util.PriorityQueue;
  import java.util.*;
  import java.io.*;
  
  // Java Template Pramod Hosahalli...
  public class Solution {
  
  	//static FastReader in = new FastReader();
  	static BufferedReader in = new BufferedReader(new InputStreamReader(System.in));
  	static int mod = 1000000007;
  
  	private static void go() throws Exception {
  		char[] ch = in.readLine().toCharArray();
  		int s = 0;
  		int missing = 0;
  
  		if(ch[0] == '0')missing = 1;
  
  		if(ch.length == 1){
  			s+=missing;
  		}
  
  		for(int i = 1; i < ch.length; i++){
  			if(ch[i] - '0' == missing){
  				s+=missing;
  				missing = (ch[i] - '0' + 1) % 2;
  			}
  			if(i == ch.length-1) s+=missing;
  		}
  
  		s = Math.min(s, 2);
  		print(1, s+"");
  	}
  
  	public static void main(String[] args) throws Exception {
  		int t = pi(in.readLine());
  		while(t-- > 0){
  			go();
  		}
  		in.close();
  	}
  
  	static long mul(long a, long b) {
  		return ((a % mod) * (b % mod)) % mod;
  	}
  
  	static class FastReader {
  		final private int BUFFER_SIZE = 1 << 16;
  		private DataInputStream din;
  		private byte[] buffer;
  		private int bufferPointer, bytesRead;
  
  		public FastReader() {
  			din = new DataInputStream(System.in);
  			buffer = new byte[BUFFER_SIZE];
  			bufferPointer = bytesRead = 0;
  		}
  
  		public FastReader(String file_name) throws IOException {
  			din = new DataInputStream(new FileInputStream(file_name));
  			buffer = new byte[BUFFER_SIZE];
  			bufferPointer = bytesRead = 0;
  		}
  
  		public int[] readIntArray(int n) throws IOException{
  			int[] fx = new int[n];
  			for(int i = 0; i < n; i++) fx[i] = ni();
  			return fx;
  		}
  
  		public long[] readLongArray(int n) throws IOException {
  			long[] fx = new long[n];
  			for(int i = 0; i < n; i++) fx[i] = nl();
  			return fx;
  		}
  
  		public String readLine() throws IOException {
  			byte[] buf = new byte[64]; // line length
  			int cnt = 0, c;
  			while ((c = read()) != -1) {
  				if (c == '\n') {
  					if (cnt != 0) {
  						break;
  					} else {
  						continue;
  					}
  				}
  				buf[cnt++] = (byte) c;
  			}
  			return new String(buf, 0, cnt);
  		}
  
  		public int ni() throws IOException {
  			int ret = 0;
  			byte c = read();
  			while (c <= ' ') {
  				c = read();
  			}
  			boolean neg = (c == '-');
  			if (neg)
  				c = read();
  			do {
  				ret = ret * 10 + c - '0';
  			} while ((c = read()) >= '0' && c <= '9');
  
  			if (neg)
  				return -ret;
  			return ret;
  		}
  
  		public long nl() throws IOException {
  			long ret = 0;
  			byte c = read();
  			while (c <= ' ')
  				c = read();
  			boolean neg = (c == '-');
  			if (neg)
  				c = read();
  			do {
  				ret = ret * 10 + c - '0';
  			} while ((c = read()) >= '0' && c <= '9');
  			if (neg)
  				return -ret;
  			return ret;
  		}
  
  		public double nd() throws IOException {
  			double ret = 0, div = 1;
  			byte c = read();
  			while (c <= ' ')
  				c = read();
  			boolean neg = (c == '-');
  			if (neg)
  				c = read();
  
  			do {
  				ret = ret * 10 + c - '0';
  			} while ((c = read()) >= '0' && c <= '9');
  
  			if (c == '.') {
  				while ((c = read()) >= '0' && c <= '9') {
  					ret += (c - '0') / (div *= 10);
  				}
  			}
  
  			if (neg)
  				return -ret;
  			return ret;
  		}
  
  		private void fillBuffer() throws IOException {
  			bytesRead = din.read(buffer, bufferPointer = 0, BUFFER_SIZE);
  			if (bytesRead == -1)
  				buffer[0] = -1;
  		}
  
  		private byte read() throws IOException {
  			if (bufferPointer == bytesRead)
  				fillBuffer();
  			return buffer[bufferPointer++];
  		}
  
  		public void close() throws IOException {
  			if (din == null)
  				return;
  			din.close();
  		}
  	}
  
  	static String rl() throws Exception{
  		return in.readLine();
  	}
  
  	static int pi(String s) {
  		return Integer.parseInt(s);
  	}
  
  	static long pl(String s) {
  		return Long.parseLong(s);
  	}
  
  	static void print(int newline, String s) {
  		System.out.print(s);
  		if (newline != 0) System.out.println();
  		// System.out.flush();
  	}
  
  	static void print(int newline, int[] arr) {
  		StringBuilder sb = new StringBuilder("");
  		for(int x : arr) sb.append(x+" ");
  		System.out.print(sb.toString().trim());
  		if (newline != 0) System.out.println();
  		// System.out.flush();
  	}
  
  	static void cprint(int x) {
  		print(0, "Case #" + x + ": ");
  	}
  
  	//utility function for gcd
  	private static long gcd(long a, long b)
  	{
  		if(a == 0 || b == 0)return a + b;
  		if(a > b)return gcd(a % b, b);
  		return gcd(a, b % a);
  	}
  
  	// construct sparse table : for static range queries
  	static class SparseTable{
  		static long[][] precompute(long[] arr)
  		{
  			int n = arr.length;
  			int p = (int)((double)Math.log(n) / Math.log(2));
  			long[][] f = new long[p+1][n];
  
  			for(int i = 0; i < n; i++) f[0][i] = arr[i];
  			for(int j = 1; j <= p; j++){
  				for(int i = 0; i + (1 << j) - 1 < n; i++){
  					f[j][i] = gcd(f[j-1][i], f[j-1][i + (1 << (j-1))]);
  				}
  			}
  			return f;
  		}
  	}
  
  	//Union Rank Algorithm
  	static class UnionFind {
  		int[] parent = null;
  		int[] rank = null;
  
  		UnionFind(int n){
  			parent = new int[n];
  			rank = new int[n];
  			for(int i = 0; i < n; i++) parent[i] = i;
  		}
  
  		int find(int v){
  			if(parent[v] != v) parent[v] = find(parent[v]);
  			return parent[v];
  		}
  
  		boolean union(int x, int y) {
  			int u = find(x);
  			int v = find(y);
  
  			//both belong to same set...
  			if(u == v)return false;
  
  			if(rank[u] > rank[v])
  				parent[v] = u;
  			else if(rank[u] < rank[v])
  				parent[u] = v;
  			else{
  				parent[u] = v;
  				rank[v]++;
  			}
  			return true;
  		}
  	}
  
  	//Fenwick Tree Implementation
  	static class BIT{
  		int bit[] = null;
  
  		BIT(int n){
  			bit = new int[n+1];
  		}
  
  		private void update(int x){
  			int index = x;
  			while(index < bit.length){
  				bit[index]+=1;
  				index += (index & -index);
  			}
  		}
  
  		private int sum(int l){
  			int index = l-1;
  			int c = 0;
  			while(index > 0){
  				c+=bit[index];
  				index -= (index & -index);
  			}
  			return c;
  		}
  	}
  
  	//Suffix Array Impl
  	static class SuffixArray{
  
  		// suffix array in O(n*log^2(n))
  		public static Integer[] suffixArray(CharSequence s) {
  			int n = s.length();
  			Integer[] sa = new Integer[n];
  			int[] rank = new int[n];
  			for (int i = 0; i < n; i++) {
  				sa[i] = i;
  				rank[i] = s.charAt(i);
  			}
  			for (int len = 1; len < n; len *= 2) {
  				long[] rank2 = new long[n];
  				for (int i = 0; i < n; i++)
  					rank2[i] = ((long) rank[i] << 32) + (i + len < n ? rank[i + len] + 1 : 0);
  
  				Arrays.sort(sa, (a, b) -> Long.compare(rank2[a], rank2[b]));
  
  				for (int i = 0; i < n; i++)
  					rank[sa[i]] = i > 0 && rank2[sa[i - 1]] == rank2[sa[i]] ? rank[sa[i - 1]] : i;
  			}
  			return sa;
  		}
  	}
  
  }