There are $16$ competitors in a tournament, all of whom have different playing strengths and in any match between two players the stronger player always wins. Show that it is possible to find the strongest and second strongest players in $18$ matches.