#include<stdio.h>
long long int gcd(long long int a, long long int b)
{
	if (b == 0)
		return a;
	else
		return gcd(b, a % b);
}
void solve()
{
	long long int a, b, d, r;
	scanf("%lld %lld %lld %lld", &a, &b, &d, &r);
	long long int g, l;
	g = gcd(d, r);
	l = r / g * d;
	long long int c = l / d + l / r;
	a *= l / d;
	b *= c;
	if (a > b)
		printf("rabbit\n");
	else if (a < b)
		printf("turtle\n");
	else
	{
		b /= c;
		a /= l / d;
		long long int cnt = 1, i;
		for (i = 0; i < 100; i++)
			cnt = 10 * cnt % c;
		long long int min, mid, max;
		min = 0;
		max = cnt + 1;
		while (max - min > 1)
		{
			mid = (max + min) / 2;
			if (d * mid - r * (cnt - mid) > d)
				max = mid;
			else
				min = mid;
		}
		long long int x = min, y = cnt - x;
		b *= x + y;
		a *= x;
		if (a > b)
			printf("rabbit\n");
		else if (a < b)
			printf("turtle\n");
		else
			printf("tie\n");
	}
	return;
}
int main()
{
	int t;
	scanf("%d", &t);
	for (; t > 0; t--)
		solve();
	return 0;
}