A rectangle is divided into $n^2$ smaller rectangle by $n - 1$ horizontal lines and $n - 1$ vertical lines. Between those rectangles there are exactly $5660$ which are not congruent. For what minimum value of $n$ is this possible?