#include <bits/stdc++.h>
#define lc (o<<1)
#define rc ((o<<1)|1)
using namespace std;
#define DebugP(x) cout << "Line" << __LINE__ << " " << #x << "=" << x << endl

typedef long long LL;
typedef complex<double> Comp;

const int maxn = 2e5 + 5;
const int inf = 0x3f3f3f3f;
const int modu = 998244353;

template<class T>
inline void read(T &x)
{
    x=0;int f=0;char ch=getchar();
    while(ch<'0'||ch>'9')  {f|=(ch=='-');ch=getchar();}
    while(ch>='0'&&ch<='9'){x=(x<<1)+(x<<3)+(ch^48);ch=getchar();}
    x=f?-x:x;
    return;
}

template<class T, class ...U> void read(T &x, U& ... u) { read(x); read(u...); }


int main() {
	// freopen("input.txt", "r", stdin);
	ios::sync_with_stdio(0);
	cin.tie(0);
	LL r, x, y;
	cin >> r >> x >> y;
	LL dis = x*x + y*y, R = r*r;
	if (R == 1) cout << (int)ceil(sqrt(dis)) << "\n";
	else
	if (dis < R) cout << "2\n";
	else if (dis == R) cout << "1\n";
	else {
		if (dis % R) cout << (int)floor(sqrt(dis)/r) + 1 << "\n";
		else cout << (int)floor(sqrt(dis)/r) << "\n";
	}
	return 0;
}
#include <iostream>
#include <iomanip>
#include <fstream>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <vector>
#include <algorithm>
#include <cmath>
#include <complex>
#include <chrono>

using namespace std;

int main(int argc, const char * argv[]) {

    ios::sync_with_stdio(false);
    cin.tie(0);
    
    int N; cin >> N;
    string S, X; cin >> S >> X;
    
    vector<set<int>> dp(N + 1);
    dp[N].insert(0);
    
    for (int i = N - 1; i >= 0; i--) {
        if (X[i] == 'A') {
            for (int r = 0; r < 7; r++) {
                if (dp[i + 1].count(10 * r % 7) && dp[i + 1].count((10 * r + S[i] - '0') % 7)) dp[i].insert(r);
            }
        } else {
            for (int r = 0; r < 7; r++) {
                if (dp[i + 1].count(10 * r % 7) || dp[i + 1].count((10 * r + S[i] - '0') % 7)) dp[i].insert(r);
            }
        }
    }
    
    cout << (dp[0].count(0) ? "Takahashi" : "Aoki") << endl;
    
    return 0;
    
}

