#include <iostream>
#include <string>
#include <algorithm>
#include <functional>
#include <vector>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <tuple>
#include <cstdio>
#include <cassert>
#include <atcoder/modint>
#define rep(i, n) for(i = 0; i < n; i++)
#define int long long
using namespace std;
using namespace atcoder;

int a, b, n;
vector<int> g;

int dfs(int x) {
    if (x < 0) return 1;
    if (g[x] != -1) return g[x];

    set<int> st;
    st.insert(dfs(x - a));
    st.insert(dfs(x - b));

    int i;
    for (i = 0; ; i++) {
        if (st.find(i) == st.end()) break;
    }
    return g[x] = i;
}

bool solve(int x) {
    x %= a + b;
    if (x < b) return (x / a) % 2 == 1 ? true : false;
    return !solve(x - a) || !solve(x - b);
}

signed main() {
    cin >> n >> a >> b;
    n -= 2;
    if (solve(n)) cout << "sepa" << endl;
    else cout << "ryota" << endl;
    
    /*g = vector<int>(n + 1, -1);
    for (int i = 0; i <= n; i++) {
        bool res1 = dfs(i);
        bool res2 = solve(i);
        if (res1 != res2) { cout << "WA " << i << ": " << res1 << ", " << res2 << endl; }
    }
    cout << "OK" << endl;*/
    return 0;
}