#include <bits/stdc++.h>
using namespace std;

int main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int T;
    cin >> T;
    while (T--) {
        int N;
        cin >> N;
        int E = 0, O = 0;
        for (int i = 0; i < N; i++) {
            int x;
            cin >> x;
            if (x & 1) ++O;
            else       ++E;
        }

        int d = abs(E - O);
        bool roy;
        if (d == 1) {
            // difference exactly 1 → Roy can always force the alternation
            roy = true;
        }
        else if (d >= 2) {
            // if one color is “large enough” and the smaller pile is odd,
            // Roy can exhaust it on Hridoy’s turn
            roy = (min(E, O) % 2 == 1);
        }
        else {
            // d == 0 → perfectly balanced → Hridoy wins
            roy = false;
        }

        cout << (roy ? "Roy\n" : "Hridoy\n");
    }
    return 0;
}