MathNet 1991 — Part 01 Question 53

The numbers $1, 2, 3, \ldots, n$ are written on a blackboard (where $n \geq 3$). A move is to replace two numbers by their sum and non-negative difference. A series of moves makes all the numbers equal $k$. Find all possible $k$.