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


import java.util.Scanner;

public class Main {
	public static void main(String[] args){
		Scanner sc = new Scanner(System.in);
		double xa,ya,xb,yb,xc,yc,xp,yp;
		double abc, abp, bcp, cap;

		while(sc.hasNext()){
			xa = sc.nextDouble();
			ya = sc.nextDouble();
			xb = sc.nextDouble();
			yb = sc.nextDouble();
			xc = sc.nextDouble();
			yc = sc.nextDouble();
			xp = sc.nextDouble();
			yp = sc.nextDouble();			
			abc = calculate_area(xa,ya,xb,yb,xc,yc);
			abp = calculate_area(xa,ya,xb,yb,xp,yp);
			bcp = calculate_area(xb,yb,xc,yc,xp,yp);
			cap = calculate_area(xc,yc,xa,ya,xp,yp);

//			System.out.println(abc +"\n"+ abp +"\n"+ bcp +"\n"+ cap);

			if( -0.001 < abc-(abp+bcp+cap) && abc-(abp+bcp+cap) < 0.001){
				System.out.println("YES");
			} else {
				System.out.println("NO");
			}
		}
	}

	static double calculate_area(double x1, double y1, double x2, double y2, double x3, double y3){
		double result;
		result = 0.5 * ((x3-x1)*(y2-y1)-(y3-y1)*(x2-x1));
		if(result < 0) result*=-1;
		return result;
	}
}