If, for all $a\leq \frac{p-1}{4}$, $a$ is a square mod $p$, that if $b$ is a multiple of $2$ and $\frac{p-1}{4} < b \leq \frac{p-1}{2}$ then $b$ must be a square mod $p$. Similarly, any multiple of $3$ between $\frac{p-1}{2}$ and $\frac{3(p-1)}{4}$ must be a square, and finally any multiple of four in the range $\frac{3(p-1)}{4}$ and $p-1$ must be a square. So that gives us at least:
$\frac{p-1}{4}(1+ \frac{1}{2} + \frac{1}{3} + \frac{1}{4}) - 4 = \frac{p-1}{2} + \frac{p-1}{24}-4$
distinct perfect squares, mod $p$. But for $p > 97$, this is more than $\frac{p-1}{2}$.
So, this proof will require that you show by hand for the cases $p\leq 97$ to complete it. That's not hard to do, because if $2$ or $3$ is not a square mod $p$, then you are done, and $2$ is a square mod $p$ if $p \equiv \pm 1 \pmod{8}$ and $3$ is a suqare if $p \equiv \pm 1 \pmod{12}$, so you only really need to check primes $p\equiv \pm 1 \pmod{24}$, so $p=23, 47, 71, 73, 97$. (Actually, you do not need to check $p\equiv 1 \pmod{4}$ because then $-1$ is a square mod $p$, so all of the numbers in the largest quadrent would be squares, as well. This means you only really need to check $p=73$ and $p=97.$ But $5$ is not a quadratic residue for either for either $p$.