import java.io.*; import java.util.*; class Main { static boolean valid(double x,double y){ return x>1.0e-9||y<1.0e9; } static boolean solve(double[]x,double[]y){ double eq13; if(y[2]==y[0]){ if(x[0]==x[2])return false; eq13=-1; }else{ eq13=(x[0]-x[2])/(y[2]-y[0]); } double mi1=0,ma1=1.0/0.0; // a1<=a2<=a3 double mi2=0,ma2=1.0/0.0; if(y[0]y[1]){ double r=(x[0]-x[1])/(y[1]-y[0]); ma1=Math.min(ma1,r); mi2=Math.max(mi2,r); }else{ if(x[0]x[1]){ ma1=Math.min(ma1,-1); }else{ return false; } } if(y[1]y[2]){ double r=(x[1]-x[2])/(y[2]-y[1]); ma1=Math.min(ma1,r); mi2=Math.max(mi2,r); }else{ if(x[1]x[2]){ ma1=Math.min(ma1,-1); }else{ return false; } } if(false){ System.err.println("int1=["+mi1+","+ma1+"]"); System.err.println("int2=["+mi2+","+ma2+"]"); } if(mi1>ma1){ return valid(mi2,ma2); } if(mi2>ma2){ return valid(mi1,ma1); } if(valid(Math.min(mi1,mi2),Math.max(ma1,ma2))) return true; if(mi1>1.0e-9){ double tmp=mi2; mi2=mi1; mi1=tmp; tmp=ma2; ma2=ma1; ma1=tmp; } return ma10){ double[]x=new double[3]; double[]y=new double[3]; for(int i=0;i<3;++i)x[i]=sc.nextInt(); for(int i=0;i<3;++i)y[i]=sc.nextInt(); boolean ans=solve(x,y); out.println(ans?"YES":"NO"); } out.close(); } // http://codeforces.com/blog/entry/7018 //-----------PrintWriter for faster output--------------------------------- public static PrintWriter out; //-----------MyScanner class for faster input---------- public static class MyScanner { BufferedReader br; StringTokenizer st; public MyScanner() { br = new BufferedReader(new InputStreamReader(System.in)); } String next() { while (st == null || !st.hasMoreElements()) { try { st = new StringTokenizer(br.readLine()); } catch (IOException e) { e.printStackTrace(); } } return st.nextToken(); } int nextInt() { return Integer.parseInt(next()); } long nextLong() { return Long.parseLong(next()); } double nextDouble() { return Double.parseDouble(next()); } String nextLine(){ String str = ""; try { str = br.readLine(); } catch (IOException e) { e.printStackTrace(); } return str; } int[] nextIntArray(int n){ int[]r=new int[n]; for(int i=0;i