Answer: All $n$ which $5$ divides. If $5|n$, it's obvious that we can do this operation. Assume contrary. If $n$ is not a multiple of $n$, let $n=5k+r$ such that $4\geq r\geq1$. If a white stone is in the $(5m+s).$ place, then it will be in $(5l+s).$ place for some $l$. Let's number the white stones from left to right as $w_1,...,w_n$ and number the black stones from left to right as $b_1,...,b_n$ for their initial positions. Let $f(w_i)$ be the place which the stone $w_i$ will be in the final position and $s(w_i)$ be the place which the stone $w_i$ is in at the initial position. We know that $s(w_i) \equiv f(w_i) (mod 5)$. There are $k$ stones which hold $s(w_i) \equiv 0 (mod 5)$. So there should be $k$ stones which $f(w_i)\equiv 0 (mod 5)$. There should be $k$ numbers in the set $(5k+r+1,5k+r+2,...,10k+2r)$ which is a multiple of $5$. If $r \geq 3$, then the numbers are $5(k+1),5(k+2),...,5(2k),5(2k+1)$ so there would be $k+1$ numbers which gives us contradiction. So $r\leq 2$. There are $k+1$ stones which hold $s(w_i)\equiv 1(mod 5)$. But there are $k$ stones which hold $f(w_i)\equiv 1(mod5)$ which gives us contradiction.

Nice solution using invariants