This problem is a Mooshak version of a UVA Online Judge Problem.
Century Arts has hundreds of art galleries scattered all around the country and you are hired to write a program that determines whether any of the galleries has a critical point. The galleries are polygonal in shape and a critical point is a point inside that polygon from where the entire gallery is not visible.
For example, in gallery 1 (drawn below) point A is a critical point, but gallery 2 has no critical point at all.
The Century Arts authorities will provide you with the shape of a gallery as a sequence of \((x, y)\) co-ordinates (determined using a suitable origin) of the consecutive corner points of that gallery.
The input file consists of several data blocks. Each data block describes one gallery.
The first line of a data block contains an integer \(N (3 \leq N \leq 50\)) indicating the number of corner points of the gallery. Each of the next \(N\) lines contains two integers giving the \((x, y)\) coordinates of a corner point where \(0 \leq x, y \leq 1000\). Starting from the first point given in the input the corner points occur in the same order on the boundary of the gallery as they appear in the input. No three consecutive points are colinear.
The input file terminates with a value of 0 for \(N\).
For each gallery in the input output the word Yes if the gallery contains a critical point, otherwise output the word No. Each output must be on a separate line
| Example Input | Example Output |
4 0 0 3 0 3 3 0 3 4 0 0 3 0 1 1 0 3 0 |
No Yes |