#include <bits/stdc++.h>
using namespace std;
#define int long long
#define INT_MAX (int)(1e18)

const int N=510;

int n;
int a[N];

inline int read(){
    int t=0,f=1;
    register char c=getchar();
    while(c<'0'||c>'9') f=(c=='-')?(-1):(f),c=getchar();
    while(c>='0'&&c<='9') t=(t<<3)+(t<<1)+(c^48),c=getchar();
    return t*f;
}

void solve(){
    n=read();
    for(int i=1;i<=n;i++) a[i]=read();
    if(n==1){cout<<"Huoyu\n0\n";return;}
    if(n==2){cout<<"Shuiniao\n";return;}
    if(n==3){
        if((a[1]^a[2]^a[3])==0){cout<<"Huoyu\n1\n1 2 3\n";return;}
        cout<<"Shuiniao\n";return;
    }
    if(n==4){
        if((a[1]^a[2]^a[4])==0){cout<<"Huoyu\n1\n1 2 4\n";return;}
        if((a[1]^a[3]^a[4])==0){cout<<"Huoyu\n1\n1 3 4\n";return;}
        cout<<"Shuiniao\n";return;
    }
    if((a[1]^a[2]^a[5])==0){cout<<"Huoyu\n1\n1 2 5\n";return;}
    if((a[1]^a[3]^a[5])==0){cout<<"Huoyu\n1\n1 3 5\n";return;}
    if((a[1]^a[4]^a[5])==0){cout<<"Huoyu\n1\n1 4 5\n";return;}
    if((a[1]^a[2]^a[3]^a[4]^a[5])==0){
        if((a[1]^a[2]^a[3])==0){cout<<"Huoyu\n2\n1 2 3\n1 2 3\n";return;}
        if((a[3]^a[4]^a[5])==0){cout<<"Huoyu\n2\n3 4 5\n1 2 3\n";return;}
        cout<<"Shuiniao\n";return;
    }
    cout<<"Shuiniao\n";return;
}

signed main(){
    freopen("mergeegrem.in","r",stdin);
    freopen("mergeegrem.out","w",stdout);
    int T=read();
    while(T--) solve();
    return 0;
}