output_description: For each test case, print a line containing `0` if x becomes 0 at the end of
  the game, and `1` otherwise.
  
  * * *
input_description: Input is given from Standard Input in the following format. The first line is
  as follows:
  
      
      
      T
      
  
  Then, T test cases follow. Each test case is given in the following format:
  
      
      
      N
      A_1 A_2 \cdots A_N
      S
attempt: print(1)
  
problem_description: Statement
  
  There are two persons, numbered 0 and 1, and a variable x whose initial value
  is 0. The two persons now play a game. The game is played in N rounds. The
  following should be done in the i-th round (1 \leq i \leq N):
  
    * Person S_i does one of the following:
      * Replace x with x \oplus A_i, where \oplus represents bitwise XOR.
      * Do nothing.
  
  Person 0 aims to have x=0 at the end of the game, while Person 1 aims to have
  x \neq 0 at the end of the game.
  
  Determine whether x becomes 0 at the end of the game when the two persons play
  optimally.
  
  Solve T test cases for each input file.
samples: [{"input": "3\n    2\n    1 2\n    10\n    2\n    1 1\n    10\n    6\n    2 3 4 5 6 7\n    111000", "output": "1\n    0\n    0\n    \n\nIn the first test case, if Person 1 replaces x with 0 \\oplus 1=1, we surely\nhave x \\neq 0 at the end of the game, regardless of the choice of Person 0.\n\nIn the second test case, regardless of the choice of Person 1, Person 0 can\nmake x=0 with a suitable choice."}]