IT-CESENATICO 2008 Problem 6

Francesca and Giorgia play the following game. On a table there are initially coins piled up in some stacks, possibly in different numbers in each stack, but with at least one coin. In turn, each player chooses exactly one move between the following: (i) she chooses a stack that has an even non-zero number of coins $2k$ and breaks it into two identical stacks of coins, i.e. each stack contains $k$ coins; (ii) she removes from the table the stacks with coins in an odd number, i.e. all such in odd number, not just those with a specific odd number. At each turn, a player necessarily moves: if one choice is not available, the she must take the other. Francesca moves first. The one who removes the last coin from the table wins.

1. If initially there is only one stack of coins on the table, and this stack contains $2008^{2008}$ coins, which of the players has a winning strategy?
2. For which initial configurations of stacks of coins does Francesca have a winning strategy?