CGMO 2010 Problem 3

Prove that for every given positive integer $n$ , there exists a prime $p$ and an integer $m$ such that $(a)$ $p \equiv 5 \pmod 6$ $(b)$ $p \nmid n$ $(c)$ $n \equiv m^3 \pmod p$