What is the largest value of n such that a square cannot be divided into exactly n smaller squares without overlap or overhang, not necessarily of the same size? For example. a square can be ivided into 13 smaller squares by first dividing it into 16 smaller squares and combining the 4 center squares.