#include <bits/stdc++.h>
using namespace std;
#define ALL(x) (x).begin(), (x).end()
#define REP(i,n) for(int i=0; i<n; i++)
bool chmax(auto& a, auto b) { return a<b ? a=b, true : false; }
bool chmin(auto& a, auto b) { return a>b ? a=b, true : false; }
using ll=long long; const int INF=1e9+10; const ll INFL=4e18;

#ifdef DEBUG
#include "./debug.hpp"
#else
#define debug(...)
#define print_line
#endif

//----------------------------------------------------------

ll N,A,B;
ll mex(set<ll> st) {
    ll ret=0;
    while(st.count(ret)) ret++;
    return ret;
}
map<ll,ll> memo;
ll grundy(ll x) {
    if(x>=N) return 0;
    if(memo.count(x)) return memo[x];
    set<ll> st;
    st.insert(grundy(x+A));
    st.insert(grundy(x+B));
    return memo[x]=mex(st);
}

void solve() {
    cin>>N>>A>>B;

    for(int i=0; i<=min(3000ll,N); i++) debug(i,grundy(i));

    //[N-A~N-1]:=1
    //[N-B~N-A]:=2
    //[N-A-B~N-B]:=0

    N-=2;
    N%=(A+B);
    if(N>=B) cout<<"sepa"<<endl;
    else cout<<"ryota"<<endl;
}

int main() {
    ios::sync_with_stdio(false); cin.tie(nullptr);
    //cout<<fixed<<setprecision(15);
    int T=1; //cin>>T;
    while(T--) solve();
}