There are sixteen buildings all on the same side of a street. How many ways can we choose a nonempty subset of the buildings such that there is an odd number of buildings between each pair of buildings in the subset?

Let's think step by step and output the final answer within \boxed{}.
user