#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--) {
		long long a, b, d, r; cin >> a >> b >> d >> r;
		long long x = (d + r - 1) / r + 1;// 1サイクル
		long long a2 = a;
		long long b2 = b * x;
		if (a2 > b2) {
			cout << "rabbit" << endl;
			continue;
		}
		if (a2 < b2) {
			cout << "turtle" << endl;
			continue;
		}
		while (x % 2 == 0)x /= 2;
		while (x % 5 == 0)x /= 5;
		if (x == 1) {
			return -1;
			cout << "tie" << endl;
		}
		else {
			cout << "rabbit" << endl;
		}
	}
	return 0;
}