BG-MO 2006 Problem 1

Consider the set $A=\{1,2,3\ldots ,2^n\}, n\ge 2$ . Find the number of subsets $B$ of $A$ such that for any two elements of $A$ whose sum is a power of $2$ exactly one of them is in $B$ .

Aleksandar Ivanov