#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 = max({calc(now * 2), calc(now * 3), calc(now * 5), 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);

    int t; cin >> t;

    while(t--){
        cin >> n;

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