Let $p$ and $q$ be mutually prime natural numbers greater than $1$. Starting with the permutation $(1, 2, . . . , n)$, in one move we can switch the places of two numbers if their difference is $p$ or $q$. Prove that with such moves we can get any another permutation if and only if $n \ge p + q - 1$.