MathNet 2014 Question 49

There are $n$ tokens, each bearing an integer, possibly negative. Whenever two bear the same number $m$, replace them by one bearing $m-1$ and one bearing $m+1$. Prove that after finitely many such changes all token labels are distinct.