#include <iostream>
#include <cstdio>
#include <cmath>
#include <map>
#include <algorithm>
#include <vector>
#include <cctype>
#include <queue>
using namespace std;
typedef long long ll;
const int maxn=200005;
const int INF=0x7f7f7f7f;

inline int read(){
    int x=0,w=1;char c=getchar();
    for(;!isdigit(c);c=getchar())if(c=='-')w=-1;
    for(;isdigit(c);x=(x<<3)+(x<<1)+c-'0',c=getchar());
    return x*w;
}

inline ll readll(){
    ll x=0,w=1;char c=getchar();
    for(;!isdigit(c);c=getchar())if(c=='-')w=-1;
    for(;isdigit(c);x=(x<<3)+(x<<1)+c-'0',c=getchar());
    return x*w;
}

int a[maxn],k;

int main(){
	int t=read();
	for(;t--;){
		int n=read();
		k=0;
		for(int i=1;i<=n;i++){
			a[i]=read();
			if(a[i]>1)k++;
		}
		if(k>=2){
			printf("Grundy\n");
		}else if(k==1){
			if(n%3!=2){
				printf("Sprague\n");
			}else{
				printf("Grundy\n");
			}
		}else{
			if(n%3==1){
				printf("Grundy\n");
			}else{
				printf("Sprague\n");
			}
		}
	}
	
	
	return 0;
}