#include<bits/stdc++.h>
using namespace std;
using ll = long long;
constexpr ll mod = 998244353;

ll t,n;
vector<int> a = {2,3,5,7};
map<ll,bool> memo;
bool solve(ll now){
  if(now >= n) return false;
  if(memo.count(now)) return memo[now];
  for(int i = 0; i < 4; i++){
    if(!solve(now * a[i])) return memo[now] = 1;
  }
  return memo[now] = 0;
}
int main(){
  cin >> t;
  while(t--){
    cin >> n;
    cout << (solve(1) ?  "ryota" : "sepa") << endl;
    memo.clear();
  }
}