One hundred and one of the squares of an $n \times n$ table are colored blue. It is known that there exists a unique way to cut the table into rectangles along the boundaries of its squares with the following property: every rectangle contains exactly one blue square. Find the smallest possible $n$.

Let's think step by step and output the final answer within \boxed{}.
user