App: Suppose you've constructed n circles.  On adding the (n+1)st how many intersection points are there with the existing circles?  How is this relevant?

Entree:  It suffices to prove this for cycles.  Thing of sigma as a rotation of an n-gon

Dessert:  Show that not all of the faces are triangles.  Use that in the strategy.