What is the largest n such that a square cannot be partitioned into n smaller, nonoverlapping squares?