Question 135
Let $n \geqslant 2$ be an integer. There are $n$ positive integers written on a blackboard. In each step we choose two of the numbers on the blackboard and replace each of them by their sum. Determine all values of $n$ for which it is always possible to get $n$ identical integers in a finite number of steps.