#include "bits/stdc++.h"
#define _CRT_SECURE_NO_WARNINGS
#define rep(i,n) for(int i = 0;i < n;i++)
#define REP(i,n,k) for(int i = n;i < k;i++)
#define P(p) cout << (p) << endl;
#define sP(p) cout << setprecision(15) << fixed << p << endl;
#define Pi pair<int,int>
#define IINF 1e9
#define LINF 1e18
#define vi vector<int>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
int dx[] = { 0, 1,0,-1 };
int dy[] = { 1, 0,-1,0 };

void isPrime(ll n) {
	if (n <= 1) {
		cout << "1 1" << endl;
		return;
	}
	if (n == 2) {
		cout << "2 1" << endl;
		return;
	}
	if (n % 2 == 0){
		cout << 2 << " " << n / 2 << endl;
		return;
	}	
	for (ll i = 3; i*i <= n; i += 2) {
		if (n%i == 0) {
			cout << i << " " << n / i << endl;
			return;
		}
	}
	cout << 1 << " " << n << endl;
	return;
}

void solve() {
	int t, y;
	cin >> t >> y;
	if (t > y) {
		P("TATE");
	}
	else {
		P("YOKO");
	}
}

int main() {
	solve();
	return 0;
}