a, b, c, d, e, f = map(int, input().split())
if a == 0 and b != 0 and d != 0:
print("Ron")
elif c == 0 and d != 0:
print("Ron")
elif e == 0 and f != 0 and b != 0 and d != 0:
print("Ron")
elif b*d*f <= a*c*e:
print("Hermione")
else:
print("Ron")
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define ff first
#define ss second
#define N 200100
const int mod = 1e9+7;
template<typename T>void print(vector<T>&a,int c=0) {
for(auto&it :a)cout << it+c<< " ";
cout << endl;
}
void fast() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
}
template<typename T>T lcm(T a, T b) {
return (a * b) / (__gcd(a, b));
}
int main(){
fast();
/* Code starts here -------------------------------------------> */
int t = 1;
// cin>>t;
while(t--) {
int a;cin>>a;
int b;cin>>b;
int c;cin>>c;
int d;cin>>d;
int e;cin>>e;
int f;cin>>f;
if(b * d * f > a * c * e || (!c && d) || (!a && b && c && d)) {
cout << "Ron\n";
}else cout << "Hermione\n";
}
return 0;
} 1302. Deepest Leaves Sum | 1209. Remove All Adjacent Duplicates in String II |
994. Rotting Oranges | 983. Minimum Cost For Tickets |
973. K Closest Points to Origin | 969. Pancake Sorting |
967. Numbers With Same Consecutive Differences | 957. Prison Cells After N Days |
946. Validate Stack Sequences | 921. Minimum Add to Make Parentheses Valid |
881. Boats to Save People | 497. Random Point in Non-overlapping Rectangles |
528. Random Pick with Weight | 470. Implement Rand10() Using Rand7() |
866. Prime Palindrome | 1516A - Tit for Tat |
622. Design Circular Queue | 814. Binary Tree Pruning |
791. Custom Sort String | 787. Cheapest Flights Within K Stops |
779. K-th Symbol in Grammar | 701. Insert into a Binary Search Tree |
429. N-ary Tree Level Order Traversal | 739. Daily Temperatures |
647. Palindromic Substrings | 583. Delete Operation for Two Strings |
518. Coin Change 2 | 516. Longest Palindromic Subsequence |
468. Validate IP Address | 450. Delete Node in a BST |