408155: GYM103029 B John, Katya

John realized that he would not eat all nuts and decided to call his friend Katya (a fan of factorials). Katya suggests John to play a game:

There are $$$n$$$ factorials written on the board ($$$1!$$$, $$$2!$$$ , $$$3!$$$, ... $$$n!$$$), John goes first. John choose the number $$$i$$$, then if $$$i!$$$ is odd, then John gets one point, otherwise, Katya gets one point. Then Katya's turn, Katya chooses $$$i$$$, which hasn't chosen yet, and takes the product of two selected factorials (John's and Katya's). If product is odd, then John gets one point, otherwise, Katya gets one point.

And so on, every next move, we take the product of all the factorials that were chosen by John and Katya for all the time, then if $$$i!$$$ is odd, then John gets one point, otherwise, Katya gets one point.

The player who scores the most points wins.

Determine whether John can win if both players play optimally.

You have a number $$$n$$$ ($$$1 \le n \le 150$$$)

Write '$$$Win$$$' (without quotation marks), if John wins.

Write '$$$Draw$$$' (without quotation marks), if it will be a draw.

Write '$$$Lose$$$' (without quotation marks), if Katya wins.

1

Win

5

Lose

In the first test, the game will consist of one move. In this turn, John will call the number $$$1$$$, and get one point.