Nim Game

koosaga and cubelover play a game of Nim. There are $N$ piles of stones stacked one on top of another, and every pile holds at least one stone. The two players take turns. On your turn you choose one pile that still has stones and remove at least one stone from it. The player who removes the very last stone of all the piles loses.

koosaga moves first. Print the player who wins when both players play optimally.

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

The second line contains the number of stones in each pile, $P_1, P_2, \dots, P_N$ ($1 \le P_i \le 2 \times 10^9$), separated by spaces.

Print koosaga on one line if koosaga wins, or cubelover if cubelover wins.