Chosen-Ciphertext Attack on Rabin: Factorize n
By following the above advice (taking the equations for r and s given in the article and writing r-s) you will notice that q is  a divisor, therefore GCD(|r-s|,n) cannot be 1. There are only two options left since n is only divisible by q and p.