Find the smallest integer $n$ for which it's possible to cut a square into $2n$ squares of two sizes: $n$ squares of one size, and $n$ squares of another size. (Proposed by Bogdan Rublov)
Source: Kyiv City MO 2022 Round 1, Problem 11.5
Tags: combinatorics, cutting the paper
Find the smallest integer $n$ for which it's possible to cut a square into $2n$ squares of two sizes: $n$ squares of one size, and $n$ squares of another size. (Proposed by Bogdan Rublov)