#include <bits/stdc++.h>
using namespace std;
const double PI = 3.14159265358979;
const double PI2 = 6.28318530717958;
const double PId2 = 1.570796326794895;
template <typename T>
T sqr(T x) {
  return x * x;
}
template <typename T>
T gcd(T a, T b) {
  return (b ? gcd(b, a % b) : a);
}
long long pw(long long a, long long p, int mod) {
  long long res = 1;
  while (p) {
    if (p & 1) {
      --p;
      res = (res * a) % mod;
    } else {
      p >>= 1;
      a = (a * a) % mod;
    }
  }
  return res;
}
inline vector<int> ReadVI(int count) {
  vector<int> arrayname(count);
  for (int i = 0; i < count; i++) cin >> arrayname[i];
  return arrayname;
}
inline vector<long long> ReadVlong(int count) {
  vector<long long> arrayname(count);
  for (int i = 0; i < count; i++) cin >> arrayname[i];
  return arrayname;
}
const int MOD = 1000000007;
const int MAXVALUE = 10000001;
void ff(double a, int c, int d, double &res) { res = a * d / c; }
int main() {
  int a, b, c, d, e, f;
  cin >> a >> b >> c >> d >> e >> f;
  if (a == 0 && b && c && d || c == 0 && d || e == 0 && f && a && b && c && d)
    return cout << "Ron", 0;
  if (b == 0 || d == 0 || f == 0) return cout << "Hermione", 0;
  double p1, p2;
  ff(b, c, d, p1);
  ff(p1, e, f, p2);
  if (p2 <= a)
    cout << "Hermione";
  else
    cout << "Ron";
  return 0;
}
