Here's a congruence I'm trying to solve:
$$x^2\equiv24 \mod 125$$
What are the techniques I could use to solve it? I know about Euler's phi function, Fermat's little theorem and Chinese remainder theorem but they all seem inapplicable here. Is there something else I could use?