eolymp
bolt
Try our new interface for solving problems
Problems

Jenga game

Jenga game

To impress Lorna Campbell, Johnny English did not think of anything better than to beat her in spy jenga.

Jenga is a tall tower made of wooden blocks. Each row contains three identical rectangular bars, forming a square. The uppermost row is formed by bars standing across, below - along, below - again across, and so on.

In Spy Jenga, players take turns taking out one bar from a row. In this case, it is not allowed to remove the bars from the upper and lower row. After the block is taken out, it is deposited and does not return to the tower in the future. The tower falls if two adjacent bars are removed from the row (we believe that the tower cannot fall after a sloppy move, due to the fact that the players are true professionals). The one who just made a move and the tower fell is lost.

So, Johnny has a tower of n levels in front of him, and a very smart opponent who does not want to give up. Print who will win if Johnny starts first.

Input

One positive integer n (3n107) — the height of the tower.

Output

Print the line Johnny if Johnny wins, otherwise print Lorna.

prb9056.gif

Time limit 1 second
Memory limit 128 MiB
Input example #1
3
Output example #1
Johnny
Source 2018 Цикл Интернет-олимпиад для школьников, первая командная олимпиада сезона, October 14, Problem E