eolymp
bolt
Try our new interface for solving problems
Problems

The segments

The segments

Time limit 1 second
Memory limit 128 MiB

Two line segments are given on the plane. Each segment is parallel to either the X axis or the Y axis. Figure out how the segments intersect.

Input data

Each of two lines contains four integers: x[1], y[1], x[2], y[2] (-1000x[1], y[1], x[2], y[2]1000) - the coordinates of segment endpoints.

Output data

Print one of the next words:

  • "NO" - if the segments do not intersect;

  • "POINT" - if the segments' intersection forms a point;

  • "SEGMENT" - if the segments' intersection forms a line segment.

Examples

Input example #1
0 0 0 1
1 0 1 1
Output example #1
NO