import sys

# sys.setrecursionlimit(200005)
# sys.set_int_max_str_digits(200005)
int1 = lambda x: int(x)-1
pDB = lambda *x: print(*x, end="\n", file=sys.stderr)
p2D = lambda x: print(*x, sep="\n", end="\n\n", file=sys.stderr)
def II(): return int(sys.stdin.readline())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def LI1(): return list(map(int1, sys.stdin.readline().split()))
def LLI1(rows_number): return [LI1() for _ in range(rows_number)]
def SI(): return sys.stdin.readline().rstrip()

dij = [(0, 1), (-1, 0), (0, -1), (1, 0)]
# dij = [(0, 1), (-1, 0), (0, -1), (1, 0), (1, 1), (1, -1), (-1, 1), (-1, -1)]
# inf = -1-(-1 << 31)
inf = -1-(-1 << 62)

# md = 10**9+7
# md = 998244353

n,a,b=LI()
# win=[0]*n
# for i in range(n)[::-1]:
#     if i+a>=n:win[i]=0
#     elif i+b>=n:
#         win[i]=win[i+a]^1
#     else:
#         win[i]=(win[i+a]&win[i+b])^1
# 
# print(win)
# for i in range(n):
#     print(i,win[i])

m=a+b
i=(n-2)%m
if m-i<a or (i//a)&1:
    print("sepa")
else:
    print("ryota")