## https://yukicoder.me/problems/no/2551

def solve(N):


    def dfs(x, memo):
        if x in memo:
            return memo[x]

        can_win = False
        for a in [2, 3, 5, 7]:
            if x * a >= N:
                break
            else:
                c = dfs(x * a, memo)
                if c == 0:
                    can_win = True
        if can_win:
            memo[x] = 1
            return 1
        else:
            memo[x] = 0
            return 0

    c = dfs(1, {})
    if c == 1:
        return "sepa"
    else:
        return "ryota"



def main():
    T = int(input())
    answers = []
    for _ in range(T):
        N = int(input())
        ans = solve(N)
        answers.append(ans)

    for ans in answers:
        print(ans)















if __name__ == "__main__":
    main()