#include <bits/stdc++.h>
using namespace std;
const int N=1e5+10;
int n,a[N];
void solve() {
    cin>>n;
    for (int i=1;i<=n;i++) cin>>a[i];
    if (n==1) cout<<"Huoyu\n0\n";
    else if (n==2) cout<<"Shuiniao\n";
    else if (n<5)
    {
        for (int i=2;i<n;i++)
        {
            if ((a[1]^a[i]^a[n])==0)
            {
                cout<<"Huoyu\n1\n1 "<<i<<" "<<n<<"\n";
                return ; 
            }
        }
        cout<<"Shuiniao\n";
    }
    else if (n==5)
    {
        for (int i=1;i<=n-2;i++) 
        {
            for (int j=i+1;j<=n-1;j++)
            {
                for (int k=j+1;k<=n;k++)
                {
                    int x=a[i]^a[j]^a[k];
                    if (x==0)
                    {
                        for (int l=1;l<=n;l++)
                        {
                            for (int r=1;r<=n;r++)
                            {
                                if (l!=i && l!=j && l!=k && r!=i && r!=j && r!=k)
                                {
                                    if (a[l]^a[r]^x==0)
                                    {
                                        cout<<"Huoyu\n2\n"<<i<<" "<<j<<" "<<k<<"\n"<<1<<" "<<2<<" "<<3<<"\n";
                                        return ; 
                                    }
                                }
                            }
                        }
                    }
                }
            }
        }
        cout<<"Shuiniao\n";
        return ;
    }
    else cout<<"Shuiniao\n";
}
int main() {
    freopen("mergeegrem.in","r",stdin);
    freopen("mergeegrem.out","w",stdout); 
    int t;
    cin>>t;
    while (t--) solve();
    return 0; 
}