#include <bits/stdc++.h>
using namespace std;
using ll=long long;
bool solve(int n,int a,int b){
	vector<bool> dp(n+1);
	for(int i=1;i<=n;i++){
		if(i>=a&&dp[i-a]==false)dp[i]=true;
		if(i>=b&&dp[i-b]==false)dp[i]=true;
	}
	return dp[n-2];
	for(int i=0;i<=n;i++){
		int idx=i;
		while(idx<=n&&dp[idx]==dp[i])idx++;
		if(dp[i])cout<<"o:"<<idx-i<<endl;
		else cout<<"x:"<<idx-i<<endl;
		i=idx-1;
	}
}
bool solve2(ll n,ll a,ll b){
	n-=2;
	if(n<a)return false;
	else if(n<b){
		if(n/a%2==1)return true;
		else return false;
	}
	ll x=(b-1)%(2*a)+1;
	if(x<=a){
		n-=b;
		n%=(a+b);
		if(n<(a+b-x))return n/a%2==0;
		else return false;
	}else{
		n%=(a+b);
		if(n<(a+b-x))return n/a%2==1;
		else return true;
	}
}
		
int main(){
/*	random_device seed;
	mt19937 rnd(seed());
	int q=1000;
	while(q--){
		int n=rnd()%1000+2;
		int a=rnd()%1000+1;
		int b=rnd()%500+a;
		if(solve(n,a,b)!=solve2(n,a,b)){
			cout<<n<<" "<<a<<" "<<b<<endl;
		}
	}*/
	ll n,a,b;
	cin>>n>>a>>b;
	if(solve2(n,a,b))cout<<"sepa"<<endl;
	else cout<<"ryota"<<endl;
}