Description
Georgia and Bob decide to play a self-invented game. They draw a row of grids on paper, number the grids from left to
right by 1, 2, 3, ..., and place N chessmen on different grids, as shown in the following figure for example:
Georgia and Bob move the chessmen in turn. Every time a player will choose a chessman, and move it to the left without
going over any other chessmen or across the left edge. The player can freely choose number of steps the chessman
moves, with the constraint that the chessman must be moved at least ONE step and one grid can at most contains ONE
single chessman. The player who cannot make a move loses the game.
Georgia always plays first since "Lady first". Suppose that Georgia and Bob both do their best in the game, i.e., if
one of them knows a way to win the game, he or she will be able to carry it out.
Given the initial positions of the n chessmen, can you predict who will finally win the game?
Input
The first line of the input contains a single integer T (1 <= T <= 20), the number of test cases. Then T cases follow.
Each test case contains two lines. The first line consists of one integer N (1 <= N <= 1000), indicating the number of
chessmen. The second line contains N different integers P1, P2 ... Pn (1 <= Pi <= 10000), which are the initial
positions of the n chessmen.
Output
For each test case, prints a single line, "Georgia will win", if Georgia will win the game; "Bob will win", if Bob
will win the game; otherwise 'Not sure'.
Sample Input
2
3
1 2 3
8
1 5 6 7 9 12 14 17
Sample Output
Bob will win
Georgia will win
解释一下：
一字棋格，如：1001 1表示棋子，0表示空格。两人轮番下棋，每步棋只能对任意一个棋子操作，并且只能向左走，能走任意格，但是
不能跨越其它棋子。最后总有一人没法下了就算输。例题：1001 第一步可1010 或1100 两种下法，其中第二种是胜利下法，因为第二
人不能再下了，就输了。
现出7题：
题1: 10001 5格，先者赢还是输，赢的话，第一步怎样下？
题2: 100011 6格，先者赢还是输，赢的话，第一步怎样下？
题3: 1000111 7格，先者赢还是输，赢的话，第一步怎样下？
题4: 100011101 9格，先者赢还是输，赢的话，第一步怎样下？
题5: 100011101001 12格，先者赢还是输，赢的话，第一步怎样下？
题6: 10001110100101 14格，先者赢还是输，赢的话，第一步怎样下？
题7: 10001110100101001 17格，先者赢还是输，赢的话，第一步怎样下？
Georgia and Bob decide to play a self-invented game. They draw a row of grids on paper, number the grids from left to
right by 1, 2, 3, ..., and place N chessmen on different grids, as shown in the following figure for example:
Georgia and Bob move the chessmen in turn. Every time a player will choose a chessman, and move it to the left without
going over any other chessmen or across the left edge. The player can freely choose number of steps the chessman
moves, with the constraint that the chessman must be moved at least ONE step and one grid can at most contains ONE
single chessman. The player who cannot make a move loses the game.
Georgia always plays first since "Lady first". Suppose that Georgia and Bob both do their best in the game, i.e., if
one of them knows a way to win the game, he or she will be able to carry it out.
Given the initial positions of the n chessmen, can you predict who will finally win the game?
Input
The first line of the input contains a single integer T (1 <= T <= 20), the number of test cases. Then T cases follow.
Each test case contains two lines. The first line consists of one integer N (1 <= N <= 1000), indicating the number of
chessmen. The second line contains N different integers P1, P2 ... Pn (1 <= Pi <= 10000), which are the initial
positions of the n chessmen.
Output
For each test case, prints a single line, "Georgia will win", if Georgia will win the game; "Bob will win", if Bob
will win the game; otherwise 'Not sure'.
Sample Input
2
3
1 2 3
8
1 5 6 7 9 12 14 17
Sample Output
Bob will win
Georgia will win
解释一下：
一字棋格，如：1001 1表示棋子，0表示空格。两人轮番下棋，每步棋只能对任意一个棋子操作，并且只能向左走，能走任意格，但是
不能跨越其它棋子。最后总有一人没法下了就算输。例题：1001 第一步可1010 或1100 两种下法，其中第二种是胜利下法，因为第二
人不能再下了，就输了。
现出7题：
题1: 10001 5格，先者赢还是输，赢的话，第一步怎样下？
题2: 100011 6格，先者赢还是输，赢的话，第一步怎样下？
题3: 1000111 7格，先者赢还是输，赢的话，第一步怎样下？
题4: 100011101 9格，先者赢还是输，赢的话，第一步怎样下？
题5: 100011101001 12格，先者赢还是输，赢的话，第一步怎样下？
题6: 10001110100101 14格，先者赢还是输，赢的话，第一步怎样下？
题7: 10001110100101001 17格，先者赢还是输，赢的话，第一步怎样下？
