#include <bits/stdc++.h>
using namespace std;
#include <atcoder/all>
using namespace atcoder;
#define rep(i, n) for(int i=0;i<(n);++i)
#define rep1(i, n) for(int i=1;i<=(n);i++)
#define ll long long
using mint = modint998244353;
using P = pair<ll,ll>;
using lb = long double;
using T = tuple<ll, ll, ll>;
#ifdef LOCAL
#  include <debug_print.hpp>
#  define dbg(...) debug_print::multi_print(#__VA_ARGS__, __VA_ARGS__)
#else
#  define dbg(...) (static_cast<void>(0))
#endif

vector<int> num = {2,3,5,7};

void solve(){
    ll n;
    cin >> n;
    unordered_map<ll, bool> memo;
    auto f = [&](auto f, ll now) -> bool {
        if(now>=n) return true;
        if(memo.count(now)) return memo[now];
        bool ok = false;
        rep(i,4){
            if(!f(f, now*num[i])) ok = true;
        }   
        return memo[now] = ok;
    };
    if(f(f,1)){
        cout << "sepa" << endl;
    }
    else{
        cout << "ryota" << endl;
    }
}

int main()
{
    int t;
    cin >> t;
    rep(i,t){
        solve();
    }
    return 0;
}