I can't solve this problem: There are N stones (N<=1e18) and two players. They play alterably. At the k-th turn, player must take at least 1 stone but can take no more than k stones. Who takes the last stone is the winner. Give N, who will win the game, player 1 or player 2 ? Please help me. Tks.