KöMaL 2020 B5105

Let $n$ denote a positive integer. Determine the smallest number of colours $k$ that are sufficient for colouring the edges of any directed simple graph of $n$ vertices without producing a circuit of the same colour.