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

typedef long long ll;

// #define tpyeinput int
// inline char nc() {static char buf[1000000],*p1=buf,*p2=buf;return p1==p2&&(p2=(p1=buf)+fread(buf,1,1000000,stdin),p1==p2)?EOF:*p1++;}
// inline void read(tpyeinput &sum) {char ch=nc();sum=0;while(!(ch>='0'&&ch<='9')) ch=nc();while(ch>='0'&&ch<='9') sum=(sum<<3)+(sum<<1)+(ch-48),ch=nc();}

template<typename T>
void read(T &x) {
    int f = 1;
    x = 0;
    char ch = getchar();
    while (ch < '0' || ch > '9') {
        if (ch == '-')f = -1;
        ch = getchar();
    }
    while (ch >= '0' && ch <= '9') {
        x = x * 10 + (ch ^ 48);
        ch = getchar();
    }
    x *= f;
}

const int N = 1e6+10, M = 2*N;

void solve() {
    int n; read(n);
    int ones = 0, twos = 0;
    for(int i=0;i<n;i++)
    {
        int x;
        read(x);
        if(x == 1) ones++;
        else twos++;
    }
    if(n == 1)
    {
        puts("Sprague");
        return;
    }
    if(ones % 3 == 2 && twos == 1)
    {
        puts("Sprague");
        return;
    }
    if(!twos && ones % 3 == 1)
    {
        puts("Sprague");
        return;
    }
    puts("Grundy");
}

int main() {
#ifdef LOCAL_TEST
    freopen("test.in", "r", stdin);
#endif
    int times = 1;
    read(times);
    while(times--) {
        solve();   
    }
    return 0;
}