Problem Statement

Takahashi and Aoki will play a game against each other.
Initially, Takahashi and Aoki have A and B candies, respectively.
They will alternately do the operation below. Takahashi goes first if C=0, and Aoki goes first if C=1.

• Eat one of the candies he has.

The person who first becomes unable to do the operation loses. Which person will win?

Input

Input is given from Standard Input in the following format:
A B C

Output

If Takahashi will win, print Takahashi; if Aoki will win, print Aoki.

Constraints

• All values in input are integers.
• 0 ≤ A, B ≤ 100
• $C \in$ {0, 1}

Sample Input 1

2 1 0

Sample Output 1

Takahashi

Initially, Takahashi and Aoki have 2 and 1 candy(ies), respectively.
The game will proceed as follows:

• Takahashi eats his candy.
• Aoki eats his candy.
• Takahashi eats his candy.
• Aoki has no more candies, so Takahashi wins.

Sample Input 2

2 2 0

Sample Output 2

Aoki

Sample Input 3

2 2 1

Sample Output 3

Takahashi

见题面 Input 部分

见题面 Output 部分