Problem Description

There are $ N $ coins. Takahashi and Aoki take turns performing the following operation, starting with Takahashi.

• Choose an integer $ k $ ($ k≧0 $) and remove $ 8^k $ coins. However, $ k $ cannot be chosen such that the number of coins to be removed exceeds the number of remaining coins.

The player who cannot perform the operation loses. When both players act optimally, which player will win?

Input Format

The input is given from the standard input in the following format:

$ N $

Output Format

Output Win if Takahashi wins, and Lose if Aoki wins.

Sample Input and Output

Sample Input #1

15

Sample Output #1

Lose

Sample Input #2

10000

Sample Output #2

Win

Notes/Hints

Constraints

• $ 1 ≦ N ≦ 10^{18} $

见题面 Input 部分

见题面 Output 部分