There's a stone game like that:
Player A and player B take the stones out of a package in turns. Each of them can take 1 or 3 or 7 or 8 stons in one turn. The one who takes the last stone will lose the game.

Now there's N stones, and Player A takes the stones first. You can consider that they are both clever enough, that is, they won't make any mistakes or foolish actions. And can you solve out that whether Player A can win the game?

This problem has several cases. Each case is only one line. It's an integer N, represent the number of stones. 1 <= N <= 10000.

For each case, you just output whether Player A will win the game. If Yes, you will output "WIN", or you will output "LOSE".