Segments intersection - 2#1505
segments are given on the 2-D plane. Determine whether any two of them intersect, i.e., if there exists at least one pair of segments that share at least one common point.
Each line contains the integer coordinates of the endpoints of a segment: (x_1, y_1) and (x_2, y_2). It is known that n \leq 6 \times 10^5 and -2000 \leq x_1, y_1, x_2, y_2 \leq 2000.
Print **"intersect"** if any two segments intersect, or **"NOT intersect"** otherwise.
Example 1