Hi, I have this super hard task on my homework and I dont know how to do it

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

## Bookmarks