MathNet 2003 — Part 03 Question 27

You are given a $10 \times 2$ grid of unit squares. Two different squares are adjacent if they share a side. How many ways can one mark exactly nine of the squares so that no two marked squares are adjacent?