Find all prime numbers $p$ for which there exists an integer $n$ such that there are no integers $x, y$ satisfying $x^3 + y^3 \equiv n \pmod{p}$ (i.e., not all residues are the sum of two cubes).

For example, for $p = 7$, one could set $n = \pm 3$ since $x^3, y^3 \equiv 0, \pm 1 \pmod{7}$, thus $x^3 + y^3 \equiv 0, \pm 1, \pm 2 \pmod{7}$ only.

Let's think step by step and output the final answer within \boxed{}.
user