A. Bald and Tourist
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output

Bald was wandering along the beautiful gardens of AUC, when he came across one of his students in competitive programming (CP) — Tourist. Upon meeting, they decided to hold a contest to determine who is the better competitor.

The contest consists of $$$n$$$ problems. Their difficulties are given by a permutation$$$^\dagger$$$ $$$p$$$ of length $$$n$$$, where problem $$$i$$$ has difficulty $$$p_i$$$. If a player solves a problem, its difficulty is added to their score, and the problem is removed from the contest.

The two players take turns. On each turn, the current player chooses one of the remaining problems and solves it. Bald, being overly confident, allows Tourist to start first.

It is known that both players are capable of solving every problem in the contest. In other words, whenever a player chooses a problem, he will successfully solve it. Assuming both players play optimally, determine the winner.

$$$\rule{20em}{0.4pt}$$$

$$$^\dagger$$$ A permutation is a sequence of integers from 1 to n of length n containing each number exactly once. For example, the sequences (1), (5, 4, 1, 2, 3), (1, 3, 2) are permutations, while (1, 1), (4, 3, 1), (2, 3, 4) are not.

Input

The first line contains a single integer $$$n$$$ $$$(1 \leq n \leq 10^5)$$$.

The second line contains $$$n$$$ integers $$$p_1, p_2, p_3, \dots p_n$$$ $$$(1 \leq p_i \leq n)$$$.

It is guaranteed that $$$p$$$ is a permutation.

Output

Output the winner of the contest. If Bald wins, output Bald. Otherwise, output Tourist.

Example
Input
3
1 3 2
Output
Tourist
Note

In the given example, there are $$$3$$$ problems with difficulties $$$1, 3$$$ and $$$2$$$. The contest proceeds as follows:

  1. Tourist picks the second problem with difficulty $$$3$$$ and solves it. His score is now 3. Problems $$$1$$$ and $$$3$$$ remain for the next round.
  2. Bald chooses the third problem with difficulty $$$2$$$, which gets added to his score.
  3. Finally, Tourist chooses the only remaining problem with difficulty $$$1$$$.

The game ends with Tourist having a score of $$$4$$$, and Bald having a score of $$$2$$$. Hence, Tourist is the winner.