I feel like I'm approaching this stupidly, so if you have any ideas, I would be grateful. Hints that trivialize the problem are not welcome.

The integers 1 to n listed in order. A swap is a switching of any two elements in the list. Prove that any sequence of swaps that takes the original list to itself contains an even number of swaps.

"Happiness is a choice."