There is a triangle formed by three points $(x_1, y_1)$, $(x_2, y_2)$, $(x_3, y_3)$ on a plain.

Write a program which prints "YES" if a point $P$ $(x_p, y_p)$ is in the triangle and "NO" if not.

Constraints

You can assume that:

* $ -100 \leq x_1, y_1, x_2, y_2, x_3, y_3, x_p, y_p \leq 100$
* 1.0 $\leq$ Length of each side of a tringle
* 0.001 $\leq$ Distance between $P$ and each side of a triangle

Input

Input consists of several datasets. Each dataset consists of:

$x_1$ $y_1$ $x_2$ $y_2$ $x_3$ $y_3$ $x_p$ $y_p$


All the input are real numbers. Input ends with EOF. The number of datasets is less than or equal to 100.

Output

For each dataset, print "YES" or "NO" in a line.

Example

Input

0.0 0.0 2.0 0.0 2.0 2.0 1.5 0.5
0.0 0.0 1.0 4.0 5.0 3.0 -1.0 3.0


Output

YES
NO
class point:
    def __init__(self, x, y):
        self.x = x
        self.y = y
    def sub(self, p):
        return point(self.x - p.x, self.y - p.y)

while 1:
    try:
        x1, y1, x2, y2, x3, y3, xp, yp = map(float, raw_input().split())
        A = point(x1, y1)
        B = point(x2, y2)
        C = point(x3, y3)
        P = point(xp, yp)

        AB = B.sub(A)
        BP = P.sub(B)
        BC = C.sub(B)
        CP = P.sub(C)
        CA = A.sub(C)
        AP = P.sub(A)

        c1 = AB.x * BP.y - AB.y * BP.x
        c2 = BC.x * CP.y - BC.y * CP.x
        c3 = CA.x * AP.y - CA.y * AP.x

        if((c1 > 0) and (c2 > 0) and (c3 > 0) or (c1 < 0) and (c2 < 0) and (c3 < 0)): print "YES"
        else: print "NO"
    except:
        break