#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <unordered_map>
#include <unordered_set>
#include <string>
#include <limits>
#include <cstring>
using namespace std;

void solve() {

  int n; cin >> n;
  std::vector<int> a(n);
  int ev = 0, od = 0;
  for(int i = 0; i < n; i++) {
    cin >> a[i];
    if(a[i] & 1) {
      od++;
    } else {
      ev++;
    }
  }
  if(n == ev or n == od) {
    cout << "Hridoy" << endl;
    return;
  }
  if(ev == od) {
    cout << "Hridoy" << endl;
    return;
  }
  if(ev > od and n % 2 == 0) {
    cout << "Hridoy" << endl;
    return;
  }
  if(ev > od and n & 1) {
    cout << "Roy" << endl;
    return;
  }
  if(od > ev and n % 2 == 0) {
    cout << "Hridoy" << endl;
    return;
  }
  if(od > ev and n & 1) {
    cout << "Roy" << endl;
    return;
  }
  
}

int main() {
    ios::sync_with_stdio(0);
    cin.tie(nullptr);
    int t = 1; 
    cin >> t;  
    for (int i = 1; i <= t; i++) {
        solve();  
    }
    return 0;
}