$n$ ($n \ge 4$) green points are in a data space and no $4$ green points lie on one plane. Some segments which connect green points have been colored red. Number of red segments is even. Each two green points are connected with polyline which is build from red segments. Show that red segments can be split on pairs, such that segments from one pair have common end.