N,A,B = list(map(int,input().split()))

def naive(N,A,B):
        
    def f(n):
        if(n >= N):return True
        if(g(n+A)):return True
        if(g(n+B)):return True
        return False
    
    def g(n):
        if(n >= N):return False
        if(not f(n+A)):return False
        if(not f(n+B)):return False
        return True

    return "sepa" if f(0) else "ryota"

def solve(N,A,B):
    N -= 2
    N %= (A+B)
    return "ryota" if N < B else "sepa"

def test():
    from random import randint
    while(True):
        N = randint(2,5)
        A = randint(2,9)
        B = randint(A+1,10)
        n = naive(N,A,B)
        s = solve(N,A,B)
        if(n != s):
            print(N,A,B)
            print(n,"vs",s)
            exit()

#test()
print(solve(N,A,B))