MathNet 2016-part-02 — 184 problems (EN–VI) Question 138

The sides and diagonals of a convex $n$-gon are colored with $n-1$ colors. A vertex is called “good” if the sides and diagonals emanating from it all have different colors. What is the largest possible number of good vertices?