On a table there are 2016 coins standing in a row. The first half being made of coins placed up while the other half of coins is placed down. The purpose of the game is to place this coins such that their positions alternate: up-down-up-down and so on. There is only one type of move that can be done that being turning simultaneously 2 adjacent coins. What is the minimum number of moves necessary to obtain the alternate up-down configuration for the coins?
Bonus: Generalize this for \(n\) coins.