//I wrote this code 4 u today
#include <bits/stdc++.h>

template<class t> using vc = std::vector<t>;

#define nd node*
#define pnd pair<nd, nd>

using namespace std;
typedef long long ll;
typedef vector<ll> vll;
typedef pair<ll, ll> pll;
typedef vc<pll> vpll;
typedef vc<vll> vvll;
typedef vc<vpll> vvpll;

template<const ll MOD>
struct mod_mul : std::multiplies<const ll> {
    ll operator()(const ll a, const ll b) {
        return (a * b) % MOD;
    }
};


template<typename T>
inline void sort(T &a) {
    sort(a.begin(), a.end());
}

template<typename T>
inline void unique(T &a) {
    a.resize(unique(a.begin(), a.end()) - a.begin());
}

template<typename T>
inline void reverse(T &a) {
    reverse(a.begin(), a.end());
}

const ll INF = 9023372036854775808ll;
const ll MOD = 1000000007ll;

int main() {
    cin.tie(nullptr)->ios_base::sync_with_stdio(false);
    int t;
    cin >> t;
    while (t--) {
        int n;
        cin >> n;
        vc<int> a(n);
        for (auto &i : a) cin >> i;
        if (n == 1) cout << "Sprague\n";
        else {
            int xr = 0;
            std::sort(a.begin(), a.end());
            std::reverse(a.begin(), a.end());
            for (auto &i : a) xr ^= i;
            int z = xr ^ 1;
            if (z > a.back()) {
                cout << "Grundy\n";
                continue;
            }
            a.back() -= z;
            bool fl = true;
            for (auto &x : a) fl &= x < 3;
            if (fl) {
                if (n == 1) cout << "Sprague\n";
            } else {
                cout << "Grundy\n";
            }
        }
    }
}