Find the number of ways of filling in the squares of a 3 \times 3 grid so that: * Each square contains a 0 or a 1. * The sum of the numbers in each row and each column is at most 1.
An example is shown below.
+462 
