Question 171
Let $n$ be a positive integer greater than one and $B=\{1,2, \ldots, 2^{n}\}$. A subset $A$ of $B$ is called "funny" if it contains exactly one of every two distinct elements $x, y$ of $B$ whose sum is a power of two. How many funny subsets does $B$ have?