Petr and Tourist are playing an interesting game called *Simple*.
Initially there are *n* tokens,
which are taken away by alternating turns with the following rules:

- Petr plays first, and he cannot take away all the tokens in the first turn.
- In each of the remaining turns the player cannot take away more than 2
*x*tokens, where*x*is the number of tokens removed in the last turn. - The player that manages to take away the last token wins.

Since the players of this game are bad programmers, they need your help.
Given *n*, who will win the game assuming perfect play?

**Input**

Input consists of several cases,
each with an *n* between 2 and 10^{6}.

**Output**

For every *n*,
print the name of the winner.

Public test cases

**Input**

2 4 8 16

**Output**

Tourist Petr Tourist Petr

Information

- Author
- Salvador Roura
- Language
- English
- Official solutions
- C++
- User solutions
- C++