#include <bits/stdc++.h>
using namespace std;

#include <atcoder/all>
using namespace atcoder;

using ll = long long;
using mint = modint998244353;

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    ll N, A, B;
    cin >> N >> A >> B;
    N -= 1;
    string ans = "";
    if(A != 1) {
        ans = ((N - 1) % (A + B) < A ? "sepa" : "ryota");
    }else if(A == 1 && B % 2 == 1) {
        ans = (N % 2 == 1 ? "sepa" : "ryota");
    }else if(A == 1 && B % 2 == 0) {
        ll r = (N - 1) % (1 + B);
        ans = (r < B && r % 2 == 0 ? "sepa" : "ryota");
    }
    cout << ans << endl;

    // vector<int> dp(N + A + B);
    // for(int i = N - 1; i >= 0; i--) {
    //     dp[i] = (1 - dp[i + A]) & (1 - dp[i + B]);
    // }
    // for(int i = 0; i <= N; i++) {
    //     cout << dp[i] << " \n"[i == N];
    // }

    // assert((dp[0] == 1 && ans == "sepa") || (dp[0] == 0 && ans == "ryota"));
}