#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int inf=0x3f3f3f3f;
const ll INF=0x3f3f3f3f3f3f3f;
const double pi=3.1415926535897932384626;
inline ll read(){
	ll x=0,f=1;
	char ch=getchar();
	while(ch<'0'||ch>'9'){
		if(ch=='-') f=-1;
		ch=getchar();
	}
	while(ch>='0'&&ch<='9'){
		x=(x<<1)+(x<<3)+(ch^48);
		ch=getchar();
	}
	return x*f;
}
int a,b,c;
int main(){
	a=read(),b=read(),c=read();
	if(c){
		if(a<b) printf("Aoki\n");
		else printf("Takahashi\n");
	}
	else{
		if(a>b) printf("Takahashi\n");
		else printf("Aoki\n");
	}
	return 0;
}
#include <bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define ll long long
#define ff first
#define ss second
#define INF 1000000000000000000
#define pb push_back
#define vl vector<ll>
#define pll pair<ll,ll>
#define vll vector<pair<ll,ll>>
#define vi vector<int>
#define sz(a) (int)a.size()
#define all(v) v.begin(), v.end()
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
#define PI 3.141592653589793
#define o_set tree<ll, null_type, less<ll>, rb_tree_tag, tree_order_statistics_node_update>
#define o_setpll tree<pair<ll,ll>, null_type, less<pair<ll,ll>>, rb_tree_tag, tree_order_statistics_node_update>
//member functions :
//1. order_of_key(k) : number of elements strictly lesser than k
//2. find_by_order(k) : k-th element in the set
int getRand(int l, int r)
{
	uniform_int_distribution<int> uid(l, r);
	return uid(rng);
}
ll power(ll b, ll e, ll m) {
	if (e == 0) return 1;
	if (e & 1) return b * power(b * b % m, e / 2, m) % m;
	return power(b * b % m, e / 2, m);
}
ll power( ll b, ll e)
{
	if (e == 0) return 1;
	if (e & 1) return b * power(b * b, e / 2);
	return power(b * b, e / 2);
}
ll modI(ll a, ll m)
{
	ll m0 = m, y = 0, x = 1;
	if (m == 1)return 0;
	while (a > 1) {
		ll q = a / m;
		ll t = m; m = a % m;
		a = t; t = y;
		y = x - q * y; x = t;
	}
	if (x < 0) {x += m0;}
	return x;
}
void solve() {
	// possibly pick the largest prime ?
	ll a, b, c, d;
	cin >> a >> b >> c >> d;
	for (ll x = 0; x <= 1e5 + 5; x++) {
		if (a + x * b <= d * x * c) {
			cout << x; return;
		}
	}
	cout << "-1";
}
int main() {
	ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);

	// freopen("lcm.in", "r", stdin);
	// freopen("test_output.txt", "w", stdout);
	int t = 1;
	// cin >> t;
	for (int ntc = 1; ntc <= t; ntc++) {
		// cout << "Case #" << ntc << ": ";
		solve();
	}
	return 0;
}