OME 2002 Problem 6

In a regular polygon $H$ of $6n+1$ sides ( $n$ is a positive integer), we paint $r$ vertices red, and the rest blue. Demonstrate that the number of isosceles triangles that have three of their vertices of the same color does not depend on the way we distribute the colors on the vertices of $H$ .