Given n piles of stones, and there are only 2 kinds of move.

• Remove non-zero number of stones from one of the pile
• Divide one of the pile into 2 piles(not necessarily equal), and remove stone from one of the two newly formed piles.

Two players are playing this game, who will win?

Constraints: 1 <= sum of stones in all the piles <= 10^5