You have 5000 distinct finite sets. Their intersection is empty. However, the intersection of any two sets is nonempty. What is the smallest possible number of elements contained in their union?

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