MathNet 2014 Question 63

Majid wants to color the cells of an $n \times n$ chessboard into white and black so that each $2 \times 2$ subsquare contains two white cells and two black cells. In how many ways can Majid color this $n \times n$ chessboard?