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.
import java.util.*;

public class Main {

    public static Scanner sc = new Scanner(System.in);
    public static int inf=1000000007;

    public static void main(String[] args) {

        long t=sc.nextLong();

        while (t-->0){

            String s=sc.next();

            long ans=0;

            char c=s.charAt(0);
            char[] arr=s.toCharArray();

            int bzero=-1;
            int bone=-1;
            int btwo=-1;

            if (c == '0') {
                bzero=0;
                ans++;
            }
            else if(c=='1'){
                bone=0;
            }else {
                btwo=0;
            }

            int co;

            for(int i=0;i<s.length();i++){
                if(arr[i]!=c){
                    c=arr[i];
                    if(c=='0'){
                         ans++;
                    }

                }
                if (arr[i] == '0') {
                    bzero=0;
                }
                else if(arr[i]=='1'){
                    bone=0;
                }else {
                    btwo=0;
                }


                if(bzero==-1){
                    co=0;
                }else if(bone==-1){
                    co=1;
                }
                else {
                    co=2;
                }

                if(co<ans){
                    ans=co;
                    co=0;
                }

            }

            System.out.println(ans);

        }

    }

    ///////For printing elements in array

    public static void print(int[] arr){
        for(int x:arr){
            System.out.print(x+" ");
        }
        System.out.println();
    }

    ///////For freq of elements in array

    public static int[] freq(int[] freq_arr,int[] arr){
        for(int i=0;i<arr.length;i++){
            freq_arr[arr[i]]++;
        }

        return freq_arr;
    }


    ///////For sum elements in array

    public static int sum(int[] arr){

        int sum=0;

        for(int i=0;i<arr.length;i++){
            sum+=arr[i];
        }
        return sum;
    }

///////For storing elements in array

    public static int[] scan(int[] arr){
        for(int i=0;i<arr.length;i++){
            arr[i]=sc.nextInt();
        }

        return arr;
    }

///////For GCD

    public static int gcd(int a, int b)
    {
        if (b == 0)
            return a;
        return gcd(b, a % b);
    }

////////Forprime

    public static boolean isPrime(long n)
    {
        if(n < 2) return false;
        if(n == 2 || n == 3) return true;
        if(n%2 == 0 || n%3 == 0) return false;
        long sqrtN = (long)Math.sqrt(n)+1;
        for(long i = 6L; i <= sqrtN; i += 6) {
            if(n%(i-1) == 0 || n%(i+1) == 0) return false;
        }
        return true;
    }




}

