Question 48
A large side square $n$ is cut into $n^{2}$ small side squares $1$. We want to color in red or blue each of the $(n+1)^{2}$ vertices of the small squares in such a way that each of the small squares has exactly $2$ red vertices. How many possible coloring pages are there?