You have an $n$ x $n$ square which you know can be tiled completely, without overlaps, by 2×2 and 3×3 squares, using at least one of each type. What is the smallest possible value of $n$? What must $n$ be divisible by?

Inspired by BMO2 2021 P2 (BMO2 = British Math Olympiad Round 2)

Happy problem solving!

Email your solutions to [email protected]