Description

There is an interesting game played as follows:

Players: $2$;

Props: $N$ piles of stones, with the number of stones in each pile being $X_1, X_2,...,X_n$;

Rules:

1. The two players take turns to remove stones;
2. On each turn, a player selects one pile and removes any number of stones from it (at least $1$);
3. The game ends when all stones have been removed;
4. If a player has no stones to remove when it's their turn, they lose.

Assuming both players are very smart, who will win and who will lose?

Input Format

The first line contains an integer $N$;

The second line contains $N$ integers $X_i$ separated by spaces, representing the number of stones in each pile.

Output Format

Output only one line, an integer. If the first player wins, output win; if the second player wins, output lose.

Sample 1

4
7 12 9 15

win

Data Range and Hint

For all data, $N \le 5\times 10^4,1 \le X_i \le 10^5$.