Description
Time Limit: 2 sec / Memory Limit: 1024 MB
Score : 200200 points
Problem Statement
We have a deck of NN 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 card and eat it.
The 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.)
You are given a string SS consisting of 0 and 1. For each i = 1, 2, \ldots, Ni=1,2,…,N,
-
if the ii-th character of SS is 0, it means that the ii-th card from the top of the deck is good;
-
if the ii-th character of SS is 1, it means that the ii-th card from the top of the deck is bad.
Which player will lose when Takahashi goes first in the game?
Constraints
-
1 \leq N \leq 10^51≤N≤105
-
NN is an integer.
-
SS is a string of length NN consisting of 0 and 1.
-
SS contains at least one occurrence of 1.
Input
Input is given from Standard Input in the following format:
NNSS
Output
Print the name of the player who will lose when Takahashi goes first in the game: Takahashi or Aoki.
HINT
First, Takahashi will eat a good card. Next, Aoki will eat a good card. Then, Takahashi will eat a bad card.
Thus, Takahashi will be the first to eat a bad card, so we should print Takahashi.