Question 16
Paladino has $n$ cards numbered $1$ to $n$ and divides them into two groups ($n \gt 1$). A division is perfect if at least one of the groups contains two cards such that the sum of the numbers on those cards is equal to the square of a natural number. What is the smallest value of $n$ for which all divisions of the $n$ cards into two groups are perfect?