Problem in Combinatorics

Here is a problem in Combinatorics.

Consider a balloon seller who has n balloons of different color. The seller being rather loony sells only balloons in bunches of r and that too a random set of r balloons. The question is simple. How many time would you expect to go to the seller to buy before you have atleast one balloon of each color?