Interpret a tournament as follows: the vertices are players. If (v,w) is an arc, player v beat w. Say that v is a champion if for every other player w, either v beat w or v beat a player who beat w. Show that a player with the maximum number of wins is a champion. Find a 5-vertex tournament in which every player is a champion.