Question 88
A convex polygon of $n$ sides is divided into triangles by diagonals which do not intersect inside the polygon. The triangles are painted black and white so that any two triangles with a common side are painted in different colors. For each $n$, determine the maximal difference between the number of black and the number of white triangles.