Daniel chooses some distinct subsets of $\{1, \dots, 2019\}$ such that any two distinct subsets chosen are disjoint. Compute the maximum possible number of subsets he can choose.

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