Proof Writing & Problem Solving · Superchallenge problem

What is the smallest $N$ such that every choice of $N$ different numbers from $\{1, 2, \ldots, 50\}$ contains two numbers whose product is a perfect square?