Full Subset

Suppose $S$ is a set of $n$ elements. How many ways can two (not necessarily distinct) subsets of $S$, say $A$ and $B$, be selected such that $A \cup B = S$. Report the answer when $n = 8$. The order of $A$ and $B$ is irrelevant.