Given the following game, what is the strategy to win?
Given $N$ towers of different heights. Two players play against each other. Each player (in his turn) divides each of the towers which are greater than 1 into two separate towers. The player who wins is the one that after his (last) turn all towers are of height 1.
Any help would be appreciated.