Question 3
Each side and each diagonal of a convex $n$-gon is colored in one of $k$ colors. It is known that there doesn't exist a closed monochrome broken line whose vertices are also the vertices of the given $n$-gon. Determine the largest possible value of $n$. (Russia 1990)