Choose numbers from $1$ to $2n$ uniformly at random. How many numbers must be chosen, on average, before at least $n$ numbers have been picked?
This is similar to the coupon-collector problem, but looking for only partial completion.
Note: Choosing an appropriate meaning of 'random' is part of the question.