#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define int ll

const int N = 1e5+10,mo = 1e9+7;

int a[N],n;




inline void solve(){
    cin >> n;
    for (int i = 1; i <= n; i++)cin >> a[i];
    ll cnt1 = 0, cnt2 = 0;
    for (int i = 1; i <= n; i++){
        if (a[i] > 1)cnt2++;
        else cnt1++;
    }
    if (n == 1){
        cout << "Sprague" << endl;
        return;
    }
    if (n == 2){
        cout << "Grundy" << endl;
        return;
    }
    if (cnt2 == 0 && cnt1 % 3 == 1){
        cout << "Sprague" << endl;
        return;
    }
    if (cnt2 == 1 && (cnt1 % 3 == 0 || cnt1 % 3 == 2)){
        cout << "Sprague" << endl;
        return;
    }
    cout << "Grundy" << endl;
}



signed main(){
    ios::sync_with_stdio(false),cin.tie(0),cout.tie(0);
    int WTN666=1;cin>>WTN666;
    while(WTN666--){
        solve();
    }
}