HMMT 2008 C8

Determine the number of ways to select a sequence of 8 sets $A_{1}, A_{2}, \ldots, A_{8}$, such that each is a subset (possibly empty) of $\{1,2\}$, and $A_{m}$ contains $A_{n}$ if $m$ divides $n$.