#include <bits/stdc++.h>

using namespace std;

long long n;
map<long long, long long> dp;

int calc(long long now){
    if(dp.count(now)){
        return dp[now];
    }
    if(now >= n){
        return dp[now] = 0;
    }
    int res = 0;
    res = max(res, calc(now * 2));
    res = max(res, calc(now * 3));
    res = max(res, calc(now * 5));
    res = max(res, calc(now * 7));
    if(res == 0){
        return dp[now] = 1;
    }else{
        return dp[now] = 0;
    }
}

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

    cin >> n;

    if(calc(1) == 0){
        cout << "sepa" << endl;
    }else{
        cout << "ryota" << endl;
    }
}