Shooter#8350
The shooter needs to hit targets, but he has only one bullet left. Determine whether he can find such a point (not necessarily with integer coordinates) and the direction of the shot that a bullet fired from this point in this direction will fly through all the targets.
First line contains one integer – the number of targets. Each of the next lines contains integers x_{i1}, y_{i1}, x_{i2}, y_{i2} (-10000 \le x_{i1}, y_{i1}, x_{i2}, y_{i2} \le 10000) – the starting and the ending position of the -th target (the targets are represented as disjoint segments on the plane).
Print one line with a word YES if the solution exists and NO otherwise.
Example 1