KöMaL 2007 A417

$n \ge$3 people runs several rounds of race without any tie. Denote by $f$($n$) the smallest possible number of rounds such that for any three people, all their six possible orders occur. Prove that ln $n$<$f$($n$)<20ln $n$.