CMO 2009 Problem 5

Let $P$ be a convex $n$ polygon each of which sides and diagnoals is colored with one of $n$ distinct colors. For which $n$ does: there exists a coloring method such that for any three of $n$ colors, we can always find one triangle whose vertices is of $P$ ' and whose sides is colored by the three colors respectively.