import collections,sys,math,functools,operator,itertools,bisect,heapq,decimal,string,time,random
sys.setrecursionlimit(10**9)
#sys.set_int_max_str_digits(0)
t = int(input())
#alist = list(map(int,input().split()))
#alist = []
#s = input()
#n,m = map(int,input().split())
#for i in range(n):
#    alist.append(list(map(int,input().split())))
input = sys.stdin.readline

def calc(x,n,turn):
    if x >= n:
        return turn
    else:
        a = []
        for i in range(2):
            if i == 0:
                a.append(calc(x*2,n,turn^1))
            if i == 1:
                a.append(calc(x*7,n,turn^1))
        if a[0] == turn or a[1] == turn:
            return turn
        else:
            return turn^1
for i in range(t):
    n = int(input())
    print('sepa' if calc(1,n,0) == 0 else 'ryota')
    continue
    n = i+1
    
    c = 0
    a = ""
    b = ""
    for j in range(20):
        if 14**j < n <= 2*14**j:
            a = 'ryota'
            c = 1
            break
    if c == 0:
        a = 'sepa'
    b = 'sepa' if calc(1,n,0) == 0 else 'ryota'
    if a != b:
        print(n,a==b,end='')