poj1704

#include <iostream>
#include <algorithm>

using namespace std;

#define oo (~0U >> 1)
#define MAXN 1000 + 10

int temp[MAXN];
int node[MAXN];

void input()
{
    int n, t, x;

    cin >> t;

    while (t--)
    {
        int sum = 0;

        cin >> n;

        for (int i = 1; i <= n; i++)
        {
            cin >> temp[i];
        }

        sort(temp + 1, temp + n + 1);

        for (int i = 1; i <= n; i++)
        {
            node[i] = temp[i] - temp[i - 1] - 1;
        }

        for (int i = n; i >= 1; i -= 2)
        {
            sum ^= node[i];
        }

        cout << (!sum ? ("Bob will win") : ("Georgia will win")) << endl;
    }
}

int main()
{
    input();
    return 0;
}