package main

import . "fmt"

func main() {
	var n, a, b int
	Scan(&n,&a,&b)
	if dpsol(n, a, b) {
		Println("sepa")
	} else {
		Println("ryota")
	}
}


func dpsol(n, a, b int) bool {
	if a > n {
		return false
	}
	dp := make([]int, n+a+1)
	for i := 0; i < a; i++ {
		dp[n-a+i] = 1
	}
	for i := n; i > 1; i-- {
		if dp[i] == 0 {
			continue
		}
		if i-a > 0 {
			dp[i-a] = max(dp[i-a], 3-dp[i])
		}
		if i-b > 0 {
			dp[i-b] = max(dp[i-b], 3-dp[i])
		}
	}
	return dp[1] == 2
}