#define lmy11 LlEBE
/*using in codeforces*/
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define int long long
template<class T>using pq = priority_queue<T>;
template<class T>using pqg = priority_queue<T, vector<T>, greater<T>>;
void solve()
{
	int n1,m1,k1;
	int n2,m2,k2;
	cin>>n1>>m1>>k1;
	cin>>n2>>m2>>k2;
	if(n1+m1+k1>=m2+n2+k2)
	cout<<"Nova"<<endl;
	else
	cout<<"Twinkle"<<endl;
}
signed main()
{
	ios::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
	int T;
	T=1;
	while(T--)solve();
	return 0;
}