#include<bits/stdc++.h>
#define ff first
#define ss second
#define pb push_back
#define ll long long
using namespace std;
typedef pair<int,int> pii;

const int mod=998244353;
inline int add(int x,int y){int ret=x+y;if(ret>=mod)ret-=mod;return ret;}
inline int sub(int x,int y){int ret=x-y;if(ret<0)ret+=mod;return ret;}
inline int mul(int x,int y){return ((ll)x*y)%mod;}
inline int step(int base,int pw){int ret=1;while(pw){if(pw&1)ret=mul(ret,base);base=mul(base,base);pw>>=1;}return ret;}
inline int invv(int x){return step(x,mod-2);}

const int maxn=2e5+10;


int main(){


    ///freopen("test.txt","r",stdin);

    int t;
    scanf("%d",&t);
    while(t--){

        int n;
        scanf("%d",&n);
        int cnt1=0;
        int cnt2=0;
        for(int i=1;i<=n;i++){
            int a;
            scanf("%d",&a);
            if(a>1)cnt2++;
            else cnt1++;
        }

        /*if(n==1){
            printf("Sprague\n");
            continue;
        }
        if(n==2){
            printf("Grundy\n");
            continue;
        }*/


        int rez=0;
        int cp=0;
        while(1){

            if(cnt1==0){
                if(cnt2==1 && cp==0)rez=0;
                else rez=1;
                break;
            }

            if(cnt2==0){

                if(cp==0){
                    if(cnt1%3==1)rez=0;
                    else rez=1;
                    break;
                }
                else{
                    if(cnt1-2<=0){
                        rez=1;
                        break;
                    }
                    cnt1-=2;
                    if(cnt1%3==1)rez=0;
                    else rez=1;
                    break;
                }

            }

            if(cp==0){

                cnt2--;
                cnt1++;

            }
            else{
                cnt1-=min(2,cnt1);
            }

            cp^=1;
        }

        if(rez==0)printf("Sprague\n");
        else printf("Grundy\n");

    }

    return 0;
}