RS-SMO 2018 Problem 2

Let $n>1$ be an integer. Call a number beautiful if its square leaves an odd remainder upon divison by $n$ . Prove that the number of consecutive beautiful numbers is less or equal to $1+\lfloor \sqrt{3n} \rfloor$ .