Consider n points on the plane such that every point is connected via edges with at least five other points. Show that there must always exist at least five closed paths (i.e. cycles) such that all of them have an even number of edges or all of them have an odd number of edges.