{"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 $C=0$, and Aoki goes first if $C=1$.\n\n*   Eat one of the candies he has.\n\nThe person who first becomes unable to do the operation loses. Which person will win?\n\n## Constraints\n\n*   All values in input are integers.\n*   $0 ≤ A, B ≤ 100$\n*   $C \\in {0, 1}$\n\n## Input\n\nInput is given from Standard Input in the following format:\n\n$A$ $B$ $C$\n\n[samples]","is_translate":false,"language":"English"}],"meta":{"iden":"abc190_a","tags":[],"sample_group":[["2 1 0","Takahashi\n\nInitially, Takahashi and Aoki have $2$ and $1$ candy(ies), respectively. The game will proceed as follows:\n\n*   Takahashi eats his candy.\n*   Aoki eats his candy.\n*   Takahashi eats his candy.\n*   Aoki has no more candies, so Takahashi wins."],["2 2 0","Aoki"],["2 2 1","Takahashi"]],"created_at":"2026-03-03 11:01:13"}}