{"problem":{"name":"Bouzu Mekuri","description":{"content":"We have a deck of $N$ cards.   Each of these cards is _good_ or _bad_. Using this deck, Takahashi and Aoki will play a game against each other.   In the game, the players alternately draw the topmost ","description_type":"Markdown"},"platform":"AtCoder","limit":{"time_limit":2000,"memory_limit":262144},"difficulty":"None","is_remote":true,"is_sync":true,"sync_url":null,"sign":"abc210_b"},"statements":[{"statement_type":"Markdown","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?\n\n## Constraints\n\n*   $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`.\n\n## Input\n\nInput is given from Standard Input in the following format:\n\n$N$\n$S$\n\n[samples]","is_translate":false,"language":"English"}],"meta":{"iden":"abc210_b","tags":[],"sample_group":[["5\n00101","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`."],["3\n010","Aoki"]],"created_at":"2026-03-03 11:01:14"}}