Determine the largest possible number of groups one can compose from the integers $1, 2, 3, \ldots, 19, 20$, so that the product of the numbers in each group is a perfect square. Each group may contain exactly one number, in which case the product equals this number, and each number must be in exactly one group.

Let's think step by step and output the final answer within \boxed{}.
user