# https://yukicoder.me/problems/no/3633

def calc_gcd(A, B):
    """
    正の整数A, Bの最大公約数を計算する
    """
    a = max(A, B)
    b = min(A, B)
    while a % b > 0:
        c = a % b
        a = b
        b = c
    return b


def solve(A, B, D, R):
    gcd = calc_gcd(D, R)
    lcm = D * (R // gcd)

    gain_turn = lcm // D
    rest_turn = lcm // R

    r_gain = A * gain_turn
    t_gain = B * (gain_turn + rest_turn)
    if r_gain > t_gain:
        return "rabbit"
    elif r_gain < t_gain:
        return "turtle"
    else:
        return "tie"



def main():
    T = int(input())
    answers = []
    for _ in range(T):
        A, B, D, R = map(int, input().split())
        ans = solve(A, B, D, R)
        answers.append(ans)

    for ans in answers:
        print(ans)





if __name__ == "__main__":
    main()