Every cell of a $3 \times 3$ board is colored either red or blue. Find the number of all possible colorings such that there are no $2 \times 2$ squares where all cells are red.

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