#include<iostream>
#include<cstdio>
#include<cstring>
#include<string>
#include<vector>
#include<cmath>
#include<algorithm>
#include<map>
#include<queue>
#include<deque>
#include<iomanip>
#include<tuple>
#include<cassert>
#include<set>
#include<complex>
#include<numeric>
#include<functional>
#include<unordered_map>
#include<unordered_set>
using namespace std;
typedef long long int LL;
typedef pair<int,int> P;
typedef pair<LL,int> LP;
const int INF=1<<30;
const LL MAX=1e9+7;

void array_show(int *array,int array_n,char middle=' '){
    for(int i=0;i<array_n;i++)printf("%d%c",array[i],(i!=array_n-1?middle:'\n'));
}
void array_show(LL *array,int array_n,char middle=' '){
    for(int i=0;i<array_n;i++)printf("%lld%c",array[i],(i!=array_n-1?middle:'\n'));
}
void array_show(vector<int> &vec_s,int vec_n=-1,char middle=' '){
    if(vec_n==-1)vec_n=vec_s.size();
    for(int i=0;i<vec_n;i++)printf("%d%c",vec_s[i],(i!=vec_n-1?middle:'\n'));
}
void array_show(vector<LL> &vec_s,int vec_n=-1,char middle=' '){
    if(vec_n==-1)vec_n=vec_s.size();
    for(int i=0;i<vec_n;i++)printf("%lld%c",vec_s[i],(i!=vec_n-1?middle:'\n'));
}

namespace sol{
    const int N=7;
    bool twin[220000][N];

    void solve(){
        int n,m;
        int i,j,k;
        int a,b,c;
        cin>>n;
        string sa,sb;
        cin>>sa>>sb;
        twin[n][0]=true;
        for(i=n-1;i>=0;i--){
            a=sa[i]-'0';
            for(j=0;j<N;j++){
                b=j*10+a,c=j*10;
                b%=N,c%=N;
                if(sb[i]=='T')twin[i][j]=twin[i+1][b] || twin[i+1][c];
                else twin[i][j]=twin[i+1][b] && twin[i+1][c];
            }
        }
        if(twin[0][0])cout<<"Takahashi"<<endl;
        else cout<<"Aoki"<<endl;
    }
}

int main(){
    sol::solve();
}
#include <bits/stdc++.h>
using namespace std;
 
using ll = long long;
using ld = long double;
using ii = pair<int, int>;
 
#define fi first
#define se second
#define __lcm(a, b) a * b / __gcd(a, b)
 
const int N = 2e5 + 5;
const int MOD = 1e9 + 7;
// const int MOD = 998244353;
const int INF = 2e9;
const ll LINF = 9e18;
const int dr4[4] = {1, -1, 0, 0};
const int dc4[4] = {0, 0, 1, -1};
const int dr8[8] = {-1, -1, 0, 1, 1, 1, 0, -1};
const int dc8[8] = {0, 1, 1, 1, 0, -1, -1, -1};
 
double r, x, y;
 
void solve() {
  cin >> r >> x >> y;
  ld dist = sqrt(ld(x * x) + ld(y * y));
  ll ans = 0;
  while(1) {
    if(double(dist) <= double(r * 2)) break;
    dist -= r; ans++;
  }
  cout << ans + (dist == r ? 1 : 2) << "\n";
}
 
int main() {
 
  ios_base::sync_with_stdio(0);
  cin.tie(0); cout.tie(0);
 
  int T = 1;
  // cin >> T;
  for(int tc = 1; tc <= T; tc++) {
    solve();
  }

}