Splitting Nim

koosaga and cubelover play a version of Nim in which a pile can be split. There are $N$ piles of stacked stones, and every pile holds at least one stone. The two players alternate turns, and on your own turn you may choose one of the following two moves.

1. As in ordinary Nim, choose one pile and remove one or more stones from it.
2. Choose one pile that holds at least 2 stones and split it into two non-empty piles. No stone is removed in this move.

The player who removes the last stone left in all the piles wins. koosaga moves first. Both players play optimally. Determine who wins.

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, \ldots, 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.