using System.Collections; using System.ComponentModel; using System.Runtime.CompilerServices; using System.Runtime.InteropServices; internal class Program { private const long mod = 998244353; private const long mod17 = 1000000007; private const long INF = mod17 * mod17; public static void Main(string[] args) { List cs = new List() { 2, 3, 5, 7 }; bool query(long x) { long t = 1; while (true) { if (x < t) return true; if (t <= x && x < 2 * t) return false; t *= 14; } return true; } int t = int.Parse(Console.ReadLine()); for (int i = 0; i < t; i++) { long n = long.Parse(Console.ReadLine()); if (query(n-1)) { Console.WriteLine("sepa"); } else { Console.WriteLine("ryota"); } } /*const int mn = 400; var iswin = mkar(mn, false); iswin[0] = true; for (int i = 1; i < mn; i++) { foreach (var c in cs) { if (!iswin[i / (int)c]) iswin[i] = true; } Console.WriteLine("{0},{1}",i,iswin[i]); }*/ /*List cs = new List() { 2, 3, 5, 7 }; var nex = new SortedSet(); List ts = new List(); nex.Add(1); while (nex.Count > 0) { long val = nex.Min(); nex.Remove(val); if (val > (long)20000000000000000) continue; ts.Add(val); foreach (var c in cs) { nex.Add(val * c); } } var iswin = mkar(ts.Count,false); for (int i = 0; i < ts.Count; i++) { }*/ } public class lower_bound : IComparer where T : IComparable { public int Compare(T x, T y) { return 0 <= x.CompareTo(y) ? 1 : -1; } } public static List mkar(int n, T val) { List res = new List(n); for(int i=0;i