#include <bits/stdc++.h>
using namespace std;
struct point {
  double x, y;
  point(double x, double y) : x(x), y(y) {}
  point() { x = y = 0.0; }
  point operator+(point q) { return point(x + q.x, y + q.y); }
  point operator-(point q) { return point(x - q.x, y - q.y); }
  point operator*(double t) { return point(x * t, y * t); }
  point operator/(double t) { return point(x / t, y / t); }
  double operator*(point q) { return q.x * x + q.y * y; }
  double operator%(point q) { return x * q.y - y * q.x; }
};
const double PI = 2.0 * acos(0.0);
inline int getInt() {
  int x;
  scanf("%d", &x);
  return x;
}
inline long long getLL() {
  long long x;
  scanf("%lld", &x);
  return x;
};
inline int NUM(char c) { return (int)c - 48; }
inline char CHR(int n) { return (char)(n + 48); }
template <class T>
inline T MAX(T a, T b) {
  if (a > b) return a;
  return b;
}
template <class T>
inline T MIN(T a, T b) {
  if (a < b) return a;
  return b;
}
inline int BPM(int a, int b, int MOD) {
  if (a == 0) return 0;
  if (b == 0) return 1 % MOD;
  if (b % 2 == 1) return (int)((long long)BPM(a, b - 1, MOD) * a % MOD);
  int tmp = BPM(a, b / 2, MOD);
  return (int)((long long)tmp * tmp % MOD);
}
inline int phi(int N) {
  int ret = N;
  for (int i = 2; N > 1; i++) {
    if (i * i > N) {
      ret -= ret / N;
      break;
    }
    if (N % i == 0) {
      ret -= ret / i;
      while (N % i == 0) N /= i;
    }
  }
  return ret;
}
inline void OPEN(string s) {
  freopen((s + ".in").c_str(), "r", stdin);
  freopen((s + ".out").c_str(), "w", stdout);
}
int main() {
  long long a, b, c, d, e, f;
  cin >> a >> b >> c >> d >> e >> f;
  if (b * d * f > a * c * e)
    puts("Ron");
  else if (b * d != 0 && a * c == 0)
    puts("Ron");
  else if (d != 0 && c == 0)
    puts("Ron");
  else
    puts("Hermione");
  return 0;
}
