Coins

There are N piles of coins. Two players play alternately. In each turn, a player can remove any number of coins from a non-empty pile. At least one coin must be removed. The player who picks the last coin from the last non empty pile wins the game. It is currently your opponent’s turn. You suddenly realize that you would lose the game if he played optimally. So while he is not looking, you decide