Very Very Primitive Game

AtCoder

IDabc190_a

Time2000ms

Memory256MB

Difficulty—

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? ## Constraints * All values in input are integers. * $0 ≤ A, B ≤ 100$ * $C \in {0, 1}$ ## Input Input is given from Standard Input in the following format: $A$ $B$ $C$ [samples]

Samples

Input #1

2 1 0

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.

Input #2

2 2 0

Output #2

Aoki

Input #3

2 2 1

Output #3

Takahashi

API Response (JSON)

{
  "problem": {
    "name": "Very Very Primitive Game",
    "description": {
      "content": "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 ",
      "description_type": "Markdown"
    },
    "platform": "AtCoder",
    "limit": {
      "time_limit": 2000,
      "memory_limit": 262144
    },
    "difficulty": "None",
    "is_remote": true,
    "is_sync": true,
    "sync_url": null,
    "sign": "abc190_a"
  },
  "statements": [
    {
      "statement_type": "Markdown",
      "content": "Takahashi and Aoki will play a game against each other.  \nInitially, Takahashi and Aoki have $A$ and $B$ candies, respectively.  \nThey will alternately do the operation below. Takahashi goes first if ...",
      "is_translate": false,
      "language": "English"
    }
  ]
}

Full JSON Raw Segments