//#pragma GCC optimize(3,"Ofast","inline")
//#pragma GCC optimize(2)
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> pll;
int	 main(){
	//dabiao();
    ios::sync_with_stdio(0); cin.tie(0);
	int T=1;
	cin>>T;
	while(T--){	
		ll n;
		cin>>n;
		vector<ll>a(n+5);
		ll cnt=0;
		for(int i=1;i<=n;i++){
			cin>>a[i];
			cnt+=(a[i]!=1);
		}
		if(n==1){
			cout<<"Sprague\n";
		}
		else if(cnt==0){
			if(n%3==1){
				cout<<"Sprague\n";
			}
			else{
				cout<<"Grundy\n";
			}
		}
		else if(cnt==1){
			ll sum1=n-cnt;
			if(sum1%3==0){
				cout<<"Sprague\n";
			}
			else{
				cout<<"Grundy\n";
			}
		}
		else{
			cout<<"Grundy\n";
		}
	}
}
/*
1
4
1 1 1 1

3
2
1 2
1
5
4
1 7 2 9
*/