Small distances in convex polygons

Let d 1 < d 2 < ⋯ denote the set of all distances between two vertices of a convex n -gon. We show that the number of pairs of vertices at distance d 2 from one another is at most n + O ( 1 ) .