MathNet 2015-part-02 — 191 problems (EN–VI) Question 186

Let $S$ be the set of integers from $1$ to $2016$. In how many ways can $S$ be partitioned into two subsets $A$ and $B$ so that neither $A$ nor $B$ contains two integers whose sum is a power of $2$?