#include <bits/stdc++.h>
using namespace std;
#define FOR(i,m,n) for(int i=(m);i<(n);++i)
#define REP(i,n) FOR(i,0,n)
using ll = long long;
constexpr int INF = 0x3f3f3f3f;
constexpr long long LINF = 0x3f3f3f3f3f3f3f3fLL;
constexpr double EPS = 1e-8;
constexpr int MOD = 998244353;
// constexpr int MOD = 1000000007;
constexpr int DY4[]{1, 0, -1, 0}, DX4[]{0, -1, 0, 1};
constexpr int DY8[]{1, 1, 0, -1, -1, -1, 0, 1};
constexpr int DX8[]{0, -1, -1, -1, 0, 1, 1, 1};
template <typename T, typename U>
inline bool chmax(T& a, U b) { return a < b ? (a = b, true) : false; }
template <typename T, typename U>
inline bool chmin(T& a, U b) { return a > b ? (a = b, true) : false; }
struct IOSetup {
  IOSetup() {
    std::cin.tie(nullptr);
    std::ios_base::sync_with_stdio(false);
    std::cout << fixed << setprecision(20);
  }
} iosetup;

int main() {
  // vector<bool> can_win(n, false);
  // for (int i = n - 1; i >= 1; --i) {
  //   for (const int d : array<int, 4>{2, 3, 5, 7}) {
  //     if (i * d >= n) break;
  //     if (!can_win[i * d]) {
  //       can_win[i] = true;
  //       break;
  //     }
  //   }
  // }

  constexpr ll N = 10000000000000000LL;
  map<ll, bool> ans;
  for (ll f = 2, num = 1; f <= N; num *= 14) {
    ans[f] = false;
    f += num;
    ans[f] = true;
    f += num * 12;
  }
  int t; cin >> t;
  while (t--) {
    ll n; cin >> n;
    cout << (prev(ans.upper_bound(n))->second ? "sepa\n" : "ryota\n");
  }
  return 0;
}