L. Ltf's Board Game
time limit per test
1 second
memory limit per test
1024 megabytes
input
standard input
output
standard output

Ltf proposed an interesting board game, which is played on an $$$N \times N$$$ board by two players who take turns placing pieces on the board. The unique rule of the game is that each player, when placing a piece, must ensure that no two pieces are orthogonally adjacent, meaning that no two pieces can share a side. The player who cannot place a piece on their turn loses the game.

Ltf invited Ian to play this game with him, and Ltf will go first. Given the size of the board, determine who will win if both players play optimally.

Input

The input consists of a single line containing a positive integer $$$N$$$, representing the size of the board.

  • $$$1 \leq N \leq 10^5$$$
Output

If Ltf has a winning strategy, output Ltf on a single line; otherwise, output Ian.

Examples
Input
2
Output
Ian
Input
3
Output
Ltf