Daniel is building towers out of blocks. This time, he has many black and white blocks. He has built towers from these blocks. Now he suggests Max play the following game. Black blocks are Daniel's, while white blocks are Max's. On his turn, a player can choose any of his own blocks from any tower and remove it along with all blocks above it. As usual, the player who cannot make a move loses. Daniel takes the first move. Determine who will win if both players play optimally.
The first line contains the integer — the number of towers built. Next, lines follow, each consisting of symbols 'B' and 'W'. The symbol 'B' denotes a black block, and 'W' denotes a white block. Each line describes a tower from bottom to top.
Constraints: 1 \leq n \leq 20; each line contains at least and at most characters.
Print a single line: "Win" if Daniel wins, or "Loss" if Max wins, assuming both play optimally.
Example 1