#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N=505;
int n;
int a[N];
struct anss{
	int x,y,z;
	void print(){
		cout<<x<<" "<<y<<" "<<z<<"\n";
	}
};
void solve(){
	cin>>n;
	for(int i=1;i<=n;i++){
		cin>>a[i];
	}
	int f,ans;
	vector<anss> aa;
	if(n==1){
		f=1;
		ans=0;
	}
	else if(n==2){
		f=0;
	}
	else if(n==3){
		if((a[1]^a[2]^a[3])==0){
			f=1;
			ans=1;
			aa.push_back({1,2,3});
		}
		else f=0;
	}
	else if(n==4){
		f=0;
	}
	else{
		
	}
	if(f){
		cout<<"Huoyu\n";
		cout<<ans<<"\n";
		for(int i=0;i<ans;i++){
			aa[i].print();
		}
	}
	else{
		cout<<"Shuiniao\n";
	}
}
int main(){
    freopen("mergeegrem.in","r",stdin);
    freopen("mergeegrem.out","w",stdout);
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    int t;
    cin>>t;
    while(t--) solve();
    return 0;
} 

/*
5
1
5
2
3 4 
3
1 4 5
3
4 3 2
4
1 2 4 5


*/