#include using namespace std; #include 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; ll g = gcd(N, gcd(A, B)); N /= g, A /= g, B /= g; string ans = ""; if(A > 1) { ll r = (N - 2) % (A + B); if(r < B) { ans = (r / A % 2 == 0 ? "ryota" : "sepa"); }else { ans = "sepa"; } }else if(B % 2 == 0) { ans = (N % (B + 1) == 1 ? "sepa" : "ryota"); }else if(B % 2 == 1) { ans = (N % 2 == 1 ? "sepa" : "ryota"); } cout << ans << endl; // if(N > 500) return 0; // vector dp(N + A + B, 1); // for(int i = N - 1; i >= 0; i--) { // dp[i] = (1 - dp[i + A]) | (1 - dp[i + B]); // } // for(int i = 1; i <= N; i++) { // cout << dp[i] << " \n"[i == N]; // } // cout << endl; // assert((dp[1] == 1 && ans == "sepa") || (dp[1] == 0 && ans == "ryota")); }