MathNet 2014 Question 33

There are $2n$ chips in a row. In one move, two adjacent chips may be swapped. What is the minimum number of moves required so that every chip has been at both the beginning and the end of the row?