The cells of a $1\times 2n$ board are labelled $1,2,...,, n, -n,..., -2, -1$ from left to right. A marker is placed on an arbitrary cell. If the label of the cell is positive, the marker moves to the right a number of cells equal to the value of the label. If the label is negative, the marker moves to the left a number of cells equal to the absolute value of the label. Prove that if the marker can always visit all cells of the board, then $2n + 1$ is prime.