There are $n$ coins in a row. Two players take turns picking a coin and flipping it. The location of the heads and tails should not repeat. Loses the one who can not make a move. Which of player can always win, no matter how his opponent plays?