VMO 1994 Problem 4

There are n+1 containers arranged in a circle. One container has n stones, the others are empty. A move is to choose two containers A and B, take a stone from A and put it in one of the containers adjacent to B, and to take a stone from B and put it in one of the containers adjacent to A. We can take A = B. For which n is it possible by series of moves to end up with one stone in each container except that which originally held n stones.