#include<bits/stdc++.h>
using namespace std;
#define INF 0x3f3f3f3f
#define PI acos(-1)
#define io ios::sync_with_stdio(false); cin.tie(0); cout.tie(0)
#define mem(a,b) memset((a),(b),sizeof(a))
typedef long long ll;
typedef unsigned long long ull;
#define int long long
#define db long double

const double eps = 1e-6;
const int mod = 1e9 + 7;
const int maxn = 1e5 + 10;

int a[maxn], n;

void solve() {
    cin >> n;
    for (int i = 1; i <= n; i++) {
        cin >> a[i];
    }
    sort(a + 1, a + 1 + n);
    if (n == 1) {
        cout << "Sprague\n";
        return ;
    }
    int flag = 1;
    if ((n - 1) % 3 == 0) {
        for (int i = 1; i < n; i++) {
            if (a[i] != 1) flag = 0;
        }
    } else if (n % 3 == 0) {
        for (int i = 1; i < n; i++) {
            if (a[i] != 1) flag = 0;
        }
        if (a[n] == 1) flag = 0;
    } else {
        flag = 0;
    }
    if (flag) cout << "Sprague\n";
    else cout << "Grundy\n";
    return ;
}

signed main(){
   io;
    int T = 1;
    cin >> T;
    while(T--) {
        solve();
    }
    return 0;
}