How many ways are there to fill in a $3 \times 3$ grid of cells with $0$'s and $2$'s, one number in each cell, such that each $2 \times 2$ contiguous subgrid contains exactly three $2$'s and one $0$?

Let's think step by step and output the final answer within \boxed{}.
user