There are $n$ knights numbered $1$ to $n$ and a round table with $n$ chairs. The first knight chooses his chair, and from him, the knight number $k+1$ sits $ k$ places to the right of knight number $k$ , for all $1 \le k\le n-1$ (occupied and empty seats are counted). In particular, the second knight sits next to the first. Find all values of $n$ such that the $n$ gentlemen occupy the $n$ chairs following the described procedure.