Simple Game

Time Limit: 1000 ms Memory Limit: 65536 KiB

Problem Description

 Here is a simple game. In this game, there are several piles of stones and two players. The two players play in turn. In each turn, one can choose at least one pile and at most three piles to take away arbitrary number of stones from the pile (Of course the number of stones, which is taken away, cannot be zero and cannot be larger than the number of stones in the chosen pile). If after a player ′ s turn, there is no stone left, the player is the loser.

Suppose that the two players are all very smart. Your job is to tell whether the player who plays first can win the game or not.

Input

The input has multiple test cases. The first line of the input contains one integer C, which is the number of test cases. Each test case begins with a line contains one integer N(1 <= N <=10000),which is the number of piles. Then comes N positive integers, which are not larger than 10000000. These N integers represent the number of stones in each pile.

Output

 For each test case, output "Yes" in a single line, if the player who play first will win, otherwise output "No".

Sample Input

2
2
1
1
4
2
2
2
2

Sample Output

Yes
No

Hint

 

Source

山东省第二届ACM大学生程序设计竞赛