#include <bits/stdc++.h>
//#include <atcoder/all>
using namespace std;
// using namespace atcoder;
// using mint = modint1000000007;
// const int mod = 1000000007;
// using mint = modint998244353;
// const int mod = 998244353;
// const int INF = 1e9;
// const long long LINF = 1e18;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i, l, r) for (int i = (l); i < (r); ++i)
#define rrep(i, n) for (int i = (n)-1; i >= 0; --i)
#define rrep2(i, l, r) for (int i = (r)-1; i >= (l); --i)
#define all(x) (x).begin(), (x).end()
#define allR(x) (x).rbegin(), (x).rend()
#define P pair<int, int>
template<typename A, typename B> inline bool chmax(A& a, const B& b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A& a, const B& b) { if (a > b) { a = b; return true; } return false; }

int main() {
	std::ios::sync_with_stdio(false);
	std::cin.tie(nullptr);
	int t; cin >> t;
	while (t--) {
		using ll = long long;
		ll A, B, D, R;
		cin >> A >> B >> D >> R;
		ll dif = B * (R + D) - A * R;
		if (dif == 0) {
			{
				ll g = gcd(R, D);
				R /= g;
				D /= g;
			}
			ll t = 1;
			rep2(rp, 0, 100) {
				t *= 10;
				t %= (R + D);
			}
			t *= D;
			t %= (R + D);
			if (t > D) dif = 1;
			else if (t > 0) dif = -1;
		}
		if (dif < 0) {
			cout << "rabbit\n";
		}
		else if (dif > 0) {
			cout << "turtle\n";
		}
		else {
			cout << "tie\n";
		}
	}
	return 0;
}