Directed Graphs and Network Flows · Challenge problem

Six teams $1,\dots,6$ play a round robin. For every pair $i<j$, team $i$ beats team $j$, EXCEPT that team $6$ beats team $1$ instead of the reverse. Call a team a king if it beats every other team directly or beats some team that beat that team. How many kings does this tournament have?