#include <bits/stdc++.h>
#include <cmath>
#include <bitset>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
typedef tree<int,null_type,less_equal<int>,rb_tree_tag,tree_order_statistics_node_update>pbds;
#define ll  long long  int
#define yes cout << "Yes" << endl
#define no cout << "No" << endl
#define    gcd(a,b)         __gcd(a,b)
#define    lcm(a,b)        ((a*b)/gcd(a,b))
#define    pi               acos(-1.00)
const ll mod=1000000007;
 
void evan(int t) {
 ll n;cin>>n;
 ll a[n];
 ll od=0,ev=0;
 for(int i=0;i<n;i++){cin>>a[i];
 if(a[i]%2==0)ev++;
 else od++;
 }
 if(od==0||ev==0){
  cout<<"Hridoy\n";
 }
 else if(abs(od-ev)<=1){
  cout<<"Hridoy\n";
 }
 else cout<<"Roy\n";
}
signed main()
{
   ios_base::sync_with_stdio(false);
   cin.tie(NULL);
   cout.tie(nullptr);
    ll t=1;
 // cin>>t;
     for(int i=1;i<=t;i++){ 
         evan(i);
       }
}