Smallest n needing 6 Numbers less than n so that Product of Factorials is Square

Theorem
Let $n \in \Z_{>0}$ be a positive integer.

Then it is possible to choose at most $6$ positive integers less than $n$ such that the product of their factorials is square.

The smallest $n$ that actually requires $6$ numbers to be chosen is $527$.