OME 2003 Problem 6

We string $2n$ white balls and $2n$ black balls, forming a continuous chain. Demonstrate that, in whatever order the balls are placed, it is always possible to cut a segment of the chain to contain exactly $n$ white balls and $n$ black balls.