US-TST 2015 Problem 5

Fix a positive integer $n$. A tournament on $n$ vertices has all its edges colored by $\chi$ colors, so that any two directed edges $u \rightarrow v$ and $v \rightarrow w$ have different colors. Over all possible tournaments on $n$ vertices, determine the minimum possible value of $\chi$.