Odd Even Nim

koosaga and cubelover play an odd even variant of Nim. There are $N$ piles of stacked stones, and every pile holds at least one stone. The two players alternate turns. On your turn you pick a pile that still has stones and remove one or more stones from it.

Two rules govern a removal.

• When you remove an even number of stones, you cannot empty the pile. For example, from a pile of 8 stones you may remove 2, 4, or 6 stones, but not 8.
• When you remove an odd number of stones, you must empty the pile. So a pile of 8 stones admits no odd removal, and from a pile of 7 stones you may remove 2, 4, 6, or 7 stones.

Because of these rules, a pile holding 0 or 2 stones is frozen and can never be touched again. The game ends once every pile holds 0 or 2 stones, and the player who removed the last stone wins.

koosaga moves first. Both players play optimally. Report the winner.

The first line contains the number of piles $N$ ($1 \le N \le 100$).

The second line contains the pile sizes $P_1, P_2, \dots, P_N$ separated by spaces ($1 \le P_i \le 2{,}147{,}000{,}000$).

An input in which every $P_i$ equals 2 is never given.

Print koosaga if koosaga wins, or cubelover if cubelover wins.