Diophantine Equations · Hard problem

Every positive integer $n \equiv 1 \pmod 4$ passes the mod-$4$ test for being a sum of two squares. How many $n \equiv 1 \pmod 4$ with $1 \le n \le 60$ are nevertheless not of the form $x^2 + y^2$ with integers $x, y$?