#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() {
  const auto dp = [&](auto dp, const ll x) -> bool {
    if (x <= 2) return false;
    static unordered_map<ll, bool> dp_;
    if (const auto it = dp_.find(x); it != dp_.end()) return it->second;
    for (const int d : array<int, 4>{2, 3, 5, 7}) {
      if (d >= x) break;
      if (!dp(dp, x / d)) return dp_[x] = true;
    }
    return dp_[x] = false;
  };
  int t; cin >> t;
  while (t--) {
    ll n; cin >> n;
    cout << (dp(dp, n) ? "sepa\n" : "ryota\n");
  }
  return 0;
}