Polygon Connection Game

Ivan and Lucija are on a long journey. To pass the time, Lucija invents a game as follows:

She draws \(N\) points on a piece of paper that are the vertices of a regular \(N\)-gon, labeled consecutively from 1 to \(N\). The players take turns. On each turn, the current player chooses two points such that the straight line segment connecting them does not intersect any previously drawn segment (segments may touch at vertices), and draws that segment. If, after a player’s move, there exist three points that are pairwise connected by drawn segments (i.e. three segments forming a triangle), then that player wins. Note that segments between adjacent vertices (i.e. the sides of the polygon) are allowed and can be used to form a triangle.

Both players play optimally. Lucija moves first. Your task is to determine, for a given \(N\), which player will win the game. It can be proved that the game ends in a finite number of moves and there is always a winner.

inputFormat

The input consists of a single integer \(N\) representing the number of vertices of the regular polygon drawn by Lucija.

\(1 \leq N \leq 10^9\)

outputFormat

Output a single line containing the name of the winner: output Lucija if the first player wins, or Ivan if the second player wins.

sample

3

Lucija