OSN 2020 Problem 5

A set $A$ contains exactly $n$ integers, each of which is greater than $1$ and every of their prime factors is less than $10$ . Determine the smallest $n$ such that $A$ must contain at least two distinct elements $a$ and $b$ such that $ab$ is the square of an integer.