#include <bits/stdc++.h>
using namespace std;

#define fi first
#define se second
#define pb push_back
#define Mp make_pair
#define SZ(x) (int((x).size()))

typedef pair<int, int> pii;
typedef vector<int> vi;

map<pair<vi, int>, int> mp;
int f(vi ve, int who) {
    sort(ve.begin(), ve.end(), greater<int>());
    while(SZ(ve) && ve.back() == 0) ve.pop_back();
    if(SZ(ve) == 0) return 0;
    if(SZ(ve) == 1) return 1;
    if(mp.find(Mp(ve, who)) != mp.end()) return mp[Mp(ve, who)];
    for(int i = 0; i < SZ(ve); i++) {
        for(int j = 1; j <= ve[i]; j++) {
            ve[i] -= j;
            if(f(ve, (who + 1) % 3) == (who == 1)) {
                ve[i] += j;
                return mp[Mp(ve, who)] = 1;
            }
            ve[i] += j;
        }
    }
    return mp[Mp(ve, who)] = 0;
}
void dfs(int x, int lim, vi ve) {
    if(x == lim) {
        if(f(ve, 0) == 1) {
            for(auto i : ve)
                printf("%d ", i);
            puts("");
        }
        return;
    }
    for(int i = (x == 0 ? 0 : ve.back()); i <= 3; i++) {
        ve.pb(i);
        dfs(x + 1, lim, ve);
        ve.pop_back();
    }
}
void solve() {
    int n;
    cin >> n;
    if(n == 1) {
        cout << "Sprague\n";
        return;
    }
    int cnt1 = 0, cnt2 = 0;
    for(int i = 0; i < n; i++) {
        int a;
        cin >> a;
        if(a == 1) cnt1++;
        else cnt2++;
    }
    if(cnt2) {
        if(cnt2 > 1) {
            cout << "Grundy\n";
        } else {
            if(cnt1 % 3 != 1) {
                cout << "Sprague\n";
            } else {
                cout << "Grundy\n";
            }
        }
    } else {
        if(cnt1 % 3 == 1) {
            cout << "Sprague\n";
        } else {
            cout << "Grundy\n";
        }
    }
}
signed main() {
    ios::sync_with_stdio(false), cin.tie(0), cout.tie(0);
    // dfs(0, 12, {});
    int _; for(cin >> _; _; _--) solve();
    return 0;
}