Time limit: 1 Seconds
Memory limit: 32768K
Two players( A and B ) take turns to take stones form a heap of N stones.
There are some rules:
- A always takes first. He can take arbitrary number of stones but not all of them.
- The number of the one who will take should less than or equal the twice of the other one taken last time. But must more than one or one.
- The one who take take the last one stone is the winner.
- The two players are clever enough, they can make the best choice.
Every test case has only one line with one integer N(2 <= N <= 100000000), the numbers of the stones.
If A will lose output "lose"
If A can win,output the numbers A should take at the first time. If there are more ways to make A win, output the smallest one.