two pirate Polycarpus Vasily play interesting game they n chest coin chest number integer 1 n chest number ai coin Polycarpus Vasily turn Polycarpus move during player allow choose positive integer x 2x1n coin chest number x 2x 2x1 it turn chest coin case player do not coin chest the game finish chest emptiedpolycarpus is not greedy scrooge Polycarpys lazy slob so wonder minimum number move game finish help Polycarpus determine minimum number move game finish Note Polycarpus count move count Vasilys move