Determine the smallest integer $n \ge 1$ such that a $n \times n$ square can be cut into square pieces of size $1 \times 1$ and $2 \times 2$ with both types occuring the same number of times.
Problem
Source: 2024 Polish Junior Math Olympiad Finals P2
Tags: combinatorics, combinatorics proposed, square