Trokut

문제

Ivan and Lucija are on a journey to a place far... far away. They know that the journey will last a long time and that they will be bored at some point. While they were thinking about what to do, Lucija came up with a game.

She drew $NN$ points on paper so that they form the vertices of a regular $NN$-gon and labeled them sequentially from $11$ to $NN$. The player whose turn it is selects two of the drawn $NN$ points such that the line segment connecting those two points does not intersect any of the previously drawn line segments and connects those two points. Line segments are allowed to touch at vertices. A player wins if after their move there exist three connected line segments forming a triangle, i.e., if there exist three points such that they are all connected by the drawn line segments. Of course, players are allowed to connect adjacent vertices, and those line segments are considered for triangle formation. Players take turns, and Lucija is the first to play.

Both are extremely skilled players, and we know they will play optimally. Your task is to determine, for a given $NN$, who will be the winner of the game. It can be shown that the game will always end after a finite number of moves and that there will always be a winner.

입력

In the first row there is an integer $TT$ (1 ≤ T ≤ 10\, 000), number of scenarios. In the next $TT$ rows there is an integer $NN$ (3 ≤ N ≤ 10^9), number of points Lucija drew on a piece of paper.

출력

In $TT$ rows, for every scenario in given order, output "Ivan" or "Lucija" (without quotes), winner in a given scenario.