#include<bits/stdc++.h>
using namespace std;
#define int             long long
#define pb              push_back
#define endl            '\n'
#define pp              pair<int,pair<int,int>>
#define asort(a,n)      sort(a,a+n)
#define arrout(a,n)     for(int i=0;i<n;i++)cout<<a[i]<<" ";
#define vcout(v)        for(auto i:v)cout<<i<<" ";
#define vsort(v)        sort(v.begin(),v.end())
#define vrsort(v)       sort(v.rbegin(),v.rend());
#define YES             cout<<"YES"<<endl
#define NO              cout<<"NO"<<endl
#define yes             cout<<"yes"<<endl
#define no              cout<<"no"<<endl
#define Yes             cout<<"Yes"<<endl
#define No              cout<<"No"<<endl
#define pqr             priority_queue<int,vector<int>,greater<int>>
#define debug           cout<<"HERE"<<endl;
//void edm()
//{
//    ios::sync_with_stdio(false);cin.tie(nullptr);cout.tie(nullptr);
//#ifndef ONLINE_JUDGE
//    freopen("input.txt","r",stdin);
//    freopen("output.txt","w",stdout);
//#endif
//}
void solve()
{
    int n;cin>>n;
    int od=0,ev=0;
    for(int i=0;i<n;i++)
    {
        int x;cin>>x;
        if(x%2)ev++;
        else od++;
    }
    if(ev==od)
    {
        cout<<"Hridoy"<<endl;
        return;
    }
    int dif = max(od,ev) - min(od,ev);
    if(min(od,ev)%2==1)
    {
        cout<<"Roy"<<endl;
        return;
    }
    else
    {
        if(dif>1)
        {
            cout<<"Hridoy"<<endl;
        }
        else
        {
            cout<<"Roy"<<endl;
        }
    }
}
int32_t main()
{
//    edm();
    int t = 1;
    cin >> t;
    for(int i=1;i<=t;i++)
    {
        solve();
    }
}