#include <iostream>
#include <vector>
#include <algorithm>
#include <map>
#include <queue>
#include <set>
#include <random>
#include <iomanip>
#include <string>
#include <cmath>
#include <complex>
using namespace std;
typedef long long ll;
#define rep(i, n) for(int i = 0; i < (n); i++)

template<class T>
using vi = vector<T>;

template<class T>
using vii = vector<vi<T>>;

template<class T>
using viii = vector<vii<T>>;

template<class T>
using viiii = vector<viii<T>>;

using P = pair<ll, int>;

void chmin(ll & x, ll y) { x = min(x, y); }

void chmax(ll& x, ll y) { x = max(x, y); }

int main()
{
    ll a, b, h, w;
    cin >> a >> b >> h >> w;

    ll S0 = min(h * h * b * b, w * w * a * a);
    swap(a, b);
    ll S1 = min(h * h * b * b, w * w * a * a);

    if (S0 == S1) cout << "Same" << endl;
    else if (S0 > S1) cout << "Non-rotating" << endl;
    else cout << "Rotating" << endl;
    return 0;
}