There is a finite number of towns in a country. They are connected by one direction roads. It is known that, for any two towns, one of them can be reached from another one. Prove that there is a town such that all remaining towns can be reached from it.
combinatorics proposedcombinatorics