O. Gift Battle
time limit per test
2 с
memory limit per test
256 megabytes
input
standard input
output
standard output

Danny has finally saved enough money to buy his girlfriend Dannita a gift!

He went to the gift shop to buy the gift that he worked so hard to buy. However once there, he found that someone else was interested in buying the same gift, and there was only one article left.

Fortunately, the gift shop's policy already states what to do in such situations. When two clients want to buy the same article, they need to play a game called "Gift Battle" to decide who will get to home with the gift.

The game goes as follows: The players are given an array of $$$N$$$ numbers. The players take turns and do the following move: During his move, each player chooses a number from the array, greater than all of the numbers that he chose before, and removes it.

The first player who finds himself unable to make a move loses.

Danny will start the game. He is wondering, if he and his opponent both play optimally, can he still win the game?

Input

The first line of input contains a single integer $$$N$$$ ($$$1 \leq N \leq 1000000$$$) The following line contains $$$N$$$ integers $$$a_1a_2 ... a_n$$$ ($$$1\leq a_i \leq 10^9$$$), the array of numbers given to the players

Output

Output "WIN" if Danny wins and "LOSS" if Danny loses.

Example
Input
3
1 2 3
Output
WIN