ZOJ Problem Set - 2290
Two players(A and B) take turns to take stones form a heap of N stones.
There are some rules:
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.
Author: YANG, Xuan
Source: ZOJ Monthly, January 2005