BG-MO 2015 Problem 2

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 to rectangles along boundaries of its squares with the following property: every rectangle contains exactly one blue square. Find the smallest possible $n$.