#include<bits/stdc++.h>
#define re register
using namespace std;
inline int read(){
	re int t=0;re char v=getchar();
	while(v<'0')v=getchar();
	while(v>='0')t=(t<<3)+(t<<1)+v-48,v=getchar();
	return t;
}
const int M=998244353;
inline void add(re int &x,re int y){
	(x+=y)>=M?x-=M:x;
}
int n,m,ans,a,b,c,d;
int main(){
	a=read(),b=read(),c=read(),d=read();
	if(a+b==c+d||a+c==b+d||a+d==b+c||a==b+c+d||b==a+c+d||c==a+b+d||d==a+b+c)puts("Yes");
	else puts("No");
}
/*
* @author:  codancer
* @createTime:  2021-01-30, 20:01:13
*/

#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <cmath>
#include <vector>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <queue>
#include <ctime>
#include <cassert>
#include <complex>
#include <string>
#include <cstring>
#include <chrono>
#include <random>
#include <bitset>
using namespace std;

typedef long long ll;
typedef unsigned long long ull;
const ll mod = 1e9+7;
#define pb push_back
#define fi first
#define se second
#define SZ(x) ((int)(x).size())
#define rep(i,a,b) for(int i=(a);i<=(b);i++)
#define fep(i,a,b) for(int i=(a);i>=(b);i--)
#define deb(x) cerr<<#x<<" = "<<(x)<<"\n"
typedef vector<int> VI;
typedef vector<ll> VII;
typedef pair<int,int> pii;
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
ll Rand(ll B) {
	return (ull)rng() % B;
}
int main(){
	int a,b,c;
	cin>>a>>b>>c;
	if(c==0){
		if(a<=b){
			cout<<"Aoki"<<endl;
		}else{
			cout<<"Takahashi"<<endl;
		}
	}else{
		if(a>=b){
			cout<<"Takahashi"<<endl;
		}else{
			cout<<"Aoki"<<endl;
		}
	}
	return 0;
}