{"raw_statement":[{"iden":"problem statement","content":"We have a deck of $N$ cards.  \nEach of these cards is _good_ or _bad_.\nUsing this deck, Takahashi and Aoki will play a game against each other.  \nIn the game, the players alternately draw the topmost card and eat it.  \nThe player who first gets to eat a bad card loses the game. (Here, it is guaranteed that the deck contains at least one bad card.)\nYou are given a string $S$ consisting of `0` and `1`. For each $i = 1, 2, \\ldots, N$,\n\n*   if the $i$\\-th character of $S$ is `0`, it means that the $i$\\-th card from the top of the deck is good;\n*   if the $i$\\-th character of $S$ is `1`, it means that the $i$\\-th card from the top of the deck is bad.\n\nWhich player will **lose** when Takahashi goes first in the game?"},{"iden":"constraints","content":"*   $1 \\leq N \\leq 10^5$\n*   $N$ is an integer.\n*   $S$ is a string of length $N$ consisting of `0` and `1`.\n*   $S$ contains at least one occurrence of `1`."},{"iden":"input","content":"Input is given from Standard Input in the following format:\n\n$N$\n$S$"},{"iden":"sample input 1","content":"5\n00101"},{"iden":"sample output 1","content":"Takahashi\n\nFirst, Takahashi will eat a good card. Next, Aoki will eat a good card. Then, Takahashi will eat a bad card.  \nThus, Takahashi will be the first to eat a bad card, so we should print `Takahashi`."},{"iden":"sample input 2","content":"3\n010"},{"iden":"sample output 2","content":"Aoki"}],"translated_statement":null,"sample_group":[],"show_order":["default"],"formal_statement":null,"simple_statement":null,"has_page_source":true}