Trokut

Ivan and Lucija are on a journey to a place far, far away. The journey will last a long time, and at some point they will be bored. Lucija came up with a game to pass the time.

She drew $N$ points on paper so that they form the vertices of a regular $N$-gon, labeled from 1 to $N$ in order. On each turn, the player selects two of the drawn points so that the segment connecting them does not intersect any previously drawn segment. Segments are allowed to touch at vertices. After a move, a player wins if three drawn segments form a triangle, that is, there are three points that are each connected to the other two by drawn segments. Adjacent vertices may be connected, and those segments count toward triangles. Players take turns, and Lucija moves first.

Both players are extremely skilled and play optimally. For a given $N$, determine the winner. It can be shown that the game always ends after a finite number of moves and that there is always a winner.

The first line contains an integer $T$ ($1 \le T \le 10\,000$), the number of scenarios. Each of the next $T$ lines contains an integer $N$ ($3 \le N \le 10^9$), the number of points Lucija drew.

For each scenario, in the given order, print "Ivan" or "Lucija" on its own line, the winner of that scenario.