CMOQR 2019 Problem 4

Let $n$ be a positive integer. For a positive integer $m$ , we partition the set $\{1, 2, 3,...,m\}$ into $n$ subsets, so that the product of two different elements in the same subset is never a perfect square. In terms of $n$ , find the largest positive integer $m$ for which such a partition exists.