# A pile of chips involving powers of 2

Ann and Bob play alternately on a pile of chips. On each play, any number of chips, which is a power of 2 (including 1=$$2^0$$), can be removed from the pile. Obviously the number of chips to be removed cannot be higher than the number of chips on the current pile. The person, who removes the last chip is the winner. There are 452 chips on the pile. Ann starts. Determine a winning strategy for one of the players.