Super Hard Problem

[Guest]

Let n be a positive integer. Inside a convex polygon of perimeter 1 a
finite number of line segments is drawn such that their total length is strictly greater than n. Show
that there exists a line that intersects at least 2n + 1 of the segments.