Taro and Jiro's Game

In this problem, two players, Taro and Jiro, play a simple game. They are provided with a sequence of integers of length \(N\). The rule of the game is based solely on the parity of \(N\): if \(N \mod 2 = 1\) (i.e., \(N\) is odd), Taro wins; if \(N \mod 2 = 0\) (i.e., \(N\) is even), Jiro wins.

The sequence itself does not affect the outcome of the game. Your task is to determine the winner based on the given value of \(N\) and the corresponding sequence.

inputFormat

The input is read from stdin and consists of two lines:

1. The first line contains a single integer \(N\) \( (1 \le N \le 10^5) \), the length of the sequence.
2. The second line contains \(N\) space-separated integers. These integers represent the sequence; however, they do not influence the outcome.

outputFormat

Print a single line to stdout containing the winner's name: either Taro or Jiro.

3
2 4 3

Taro