from math import gcd

def solve(a, b, d, r):
    t = r * a - (r + d) * b
    if t:
        return 1 if t > 0 else -1
    g = gcd(d, r)
    p = g * d // r + g
    k = pow(10, 100, p)
    x = (d + k * r) // (r + d)
    t = x * d - (k - x) * r
    assert -r < t <= d
    t2 = x * a - k * b
    assert (t > 0) == (t2 > 0)
    assert (t < 0) == (t2 < 0)
    return 1 if t > 0 else -1 if t < 0 else 0

# for a in range(1, 300):
#     for b in range(1, a + 1):
#         for d in range(1, 300):
#             for r in range(1, d + 1):
#                 solve(a, b, d, r)
# exit()
ans = ['tie', 'rabbit', 'turtle']


for _ in range(int(input())):
    print(ans[solve(*map(int, input().split()))])