#include<bits/stdc++.h>
using namespace std;
#define yes cout<<"YES"<<endl
#define no cout<<"NO"<<endl
#define prime_number[21]={11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97}
///POLICY BASED DATA STRUCTURE..
///order_of_key return number of element which are strictly greater/smaller than x..
///find_by_order return ans iterator corresponding to the xth position of the set..
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace __gnu_pbds;
#define ordered_set tree<int, null_type,less_equal<int>, rb_tree_tag, tree_order_statistics_node_update>
#define ll long long int
#define faster_bro ios_base::sync_with_stdio(false);cin.tie(NULL)
#define esp 0.0000000001
#define ss second
#define ff first
#define nl cout<<endl
//memset(ar,-1,sizeof(ar));
// (1LL<<i) more than efficient pow(2,i);
void fast(){
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
}

int main(){
    fast();
    int tc;
    cin>>tc;
    int h=1;
    while(tc--){
        ll a,b,c,sum=0,sum1=0,sum2=0,cnt=0,mx=LLONG_MIN,mn=LLONG_MAX,mx1=-1e18,mx2=-1e18;
        cin>>a;
        int od=0,ev=0;
        for(int i=1;i<=a;i++){
            ll x;
            cin>>x;
            if(x%2==0){
                ev++;
            }
            else{
                od++;
            }
        }
        int f=0;
        if(a==1){
              cout<<"Roy"<<endl;
              continue;
        }
        if(od==0 || ev==0 || (od==ev)){
            cout<<"Hridoy"<<endl;
            continue;
        }
        int k=min(od,ev);
        int k1=max(od,ev);
        if(k%2!=0){
            if(k+1==k1){
             cout<<"Roy"<<endl;
            }
            else{
               cout<<"Hridoy"<<endl;
            }
        }
        else{
            cout<<"Roy"<<endl;
        }

    }
}