#[allow(unused_imports)]
use std::cmp::*;
#[allow(unused_imports)]
use std::collections::*;
use std::io::{Write, BufWriter};
// https://qiita.com/tanakh/items/0ba42c7ca36cd29d0ac8
macro_rules! input {
    ($($r:tt)*) => {
        let stdin = std::io::stdin();
        let mut bytes = std::io::Read::bytes(std::io::BufReader::new(stdin.lock()));
        let mut next = move || -> String{
            bytes
                .by_ref()
                .map(|r|r.unwrap() as char)
                .skip_while(|c|c.is_whitespace())
                .take_while(|c|!c.is_whitespace())
                .collect()
        };
        input_inner!{next, $($r)*}
    };
}

macro_rules! input_inner {
    ($next:expr) => {};
    ($next:expr, ) => {};

    ($next:expr, $var:ident : $t:tt $($r:tt)*) => {
        let $var = read_value!($next, $t);
        input_inner!{$next $($r)*}
    };
}

macro_rules! read_value {
    ($next:expr, ( $($t:tt),* )) => {
        ( $(read_value!($next, $t)),* )
    };

    ($next:expr, [ $t:tt ; $len:expr ]) => {
        (0..$len).map(|_| read_value!($next, $t)).collect::<Vec<_>>()
    };

    ($next:expr, chars) => {
        read_value!($next, String).chars().collect::<Vec<char>>()
    };

    ($next:expr, usize1) => {
        read_value!($next, usize) - 1
    };

    ($next:expr, [ $t:tt ]) => {{
        let len = read_value!($next, usize);
        (0..len).map(|_| read_value!($next, $t)).collect::<Vec<_>>()
    }};

    ($next:expr, $t:ty) => {
        $next().parse::<$t>().expect("Parse error")
    };
}

#[allow(unused)]
macro_rules! debug {
    ($($format:tt)*) => (write!(std::io::stderr(), $($format)*).unwrap());
}
#[allow(unused)]
macro_rules! debugln {
    ($($format:tt)*) => (writeln!(std::io::stderr(), $($format)*).unwrap());
}

fn ex(n: usize, k: usize) {
    let mut dp = vec![0; n];
    
    for i in 1..n {
        let hi = i / k;
        let mut s = HashSet::new();
        for j in 1..hi + 1 {
            s.insert(dp[i - j]);
        }
        let mut mex = 0;
        while s.contains(&mex) {
            mex += 1;
        }
        dp[i] = mex;
    }
    debugln!("dp[{}] = {:?}", k, dp);
    for i in 0..n {
        assert_eq!(dp[i], g(i, k));
        if i < k * k {
            assert_eq!(dp[i], g_sqr(i, k));
        }
    }
}

const W: usize = 40_000;

// TODO opt
fn g(mut a: usize, k: usize) -> usize {
    if k >= W {
        return g_sqr(a, k);
    }
    while a % k != 0 {
        a -= a / k + 1;
    }
    a / k
}

fn g_sqr(mut a: usize, k: usize) -> usize {
    assert!(a < k * k);
    while a % k != 0 {
        let r = a % k;
        let q = a / k;
        let steps = r / (q + 1);
        if r == steps * (q + 1) {
            a -= r;
            break;
        }
        a -= (steps + 1) * (q + 1);
    }
    a / k
}

fn solve() {
    let out = std::io::stdout();
    let mut out = BufWriter::new(out.lock());
    macro_rules! puts {
        ($($format:tt)*) => (write!(out,$($format)*).unwrap());
    }
    input! {
        ak: [(usize, usize)],
    }
    let mut gr = 0;
    for &(a, k) in &ak {
        gr ^= g(a, k);
    }
    puts!("{}\n", if gr == 0 { "Aoki" } else { "Takahashi" });
}

fn main() {
    // In order to avoid potential stack overflow, spawn a new thread.
    let stack_size = 104_857_600; // 100 MB
    let thd = std::thread::Builder::new().stack_size(stack_size);
    thd.spawn(|| solve()).unwrap().join().unwrap();
}


Measured memory_bytes: 8572