|시간 제한||메모리 제한||제출||정답||맞은 사람||정답 비율|
|2 초||64 MB||0||0||0||0.000%|
Anthony and his friends Ben and Chris decided to play a game. They have N piles of stones such that the i th-pile contains Ai stones. In one move a player chooses one pile and may take any non-zero number of stones from it. The players take turns. Anthony goes first then Ben and then Chris. If some player cannot make a move (no more stones exist) he loses. Ben colluded with Chris so their goal is to make Anthony lose. But Anthony doesn't want to lose. You have to find out if Anthony can avoid defeat if all players play optimally
The first line contains one integer N (1 ≤ N ≤ 105).
The next line contains N integers Ai (1 ≤ Ai ≤ 109).
Print "Lose" if Anthony will lose in this game and "Win" otherwise.
3 2 2 1
2 4 7