Question 4
Dreamland has 2016 cities. Starways establishes one-way flights between pairs of cities so that every city has exactly one outgoing flight. Find the smallest positive integer $k$ such that, for every such flight system, the cities can be partitioned into $k$ groups with no city able to reach a different city in its own group using at most 28 flights.