/**
 * A position is losing if there is an even number of piles and all values
 * are odd.
 * A position is also losing if there is an odd number of piles and all
 * values are odd after removing as many powers of 2 as the pile with the
 * smallest number of factors of 2.
 * Otherwise a position is winning.
 *
 * @author Finn Lidbetter
 */

import java.util.*;


public class splitting_pairs_finn {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int numTests = sc.nextInt();
        for (int test=0; test<numTests; test++) {
            int n = sc.nextInt();
            long[] piles = new long[n];
            boolean allOdd = true;
            boolean allEven = true;
            for (int i=0; i<n; i++) {
                piles[i] = sc.nextLong();
                if (piles[i] % 2 == 0){
                    allOdd = false;
                } else {
                    allEven = false;
                }
            }
            if (n%2==0) {
                if (allOdd) {
                    System.out.println(0);
                } else {
                    System.out.println(1);
                }
            } else {
                while (allEven) {
                    allOdd = true;
                    for (int i=0; i<n; i++) {
                        piles[i] /= 2;
                        if (piles[i]%2==0) {
                            allOdd = false;
                        } else {
                            allEven = false;
                        }
                    }
                }
                if (allOdd) {
                    System.out.println(0);
                } else {
                    System.out.println(1);
                }
            }
        }
    }
}