8. Given that $n$ is a positive integer. Find the smallest positive integer $k$ such that in a $2 n \times 2 n$ grid, marking $k$ cells ensures there is a unique way to tile the $2 n \times 2 n$ grid with $1 \times 2$ and $2 \times 1$ dominoes, and no domino contains two marked cells.