Problem

Source: Sharygin Final 2007 9.6

Tags: geometry, combinatorial geometry



A cube with edge length $2n+ 1$ is dissected into small cubes of size $1\times 1\times 1$ and bars of size $2\times 2\times 1$. Find the least possible number of cubes in such a dissection.