import java.io.BufferedReader; import java.io.BufferedWriter; import java.io.Closeable; import java.io.FileInputStream; import java.io.FileWriter; import java.io.IOException; import java.io.InputStreamReader; import java.io.PrintWriter; import java.util.ArrayList; import java.util.BitSet; import java.util.HashMap; import java.util.List; import java.util.Random; import java.util.TreeMap; public class Main { static ContestScanner in;static Writer out;static StringBuilder sb=new StringBuilder(); public static void main(String[] args) {try{in=new ContestScanner();out=new Writer();Main solve=new Main();solve.solve(); in.close();out.flush();out.close();}catch(IOException e){e.printStackTrace();}} static void dump(int[]a){sb.setLength(0);for(int i=0;i0){if((n&1)==1)r*=a;a*=a;n>>=1;}return r;} static String itob(int a,int l){return String.format("%"+l+"s",Integer.toBinaryString(a)).replace(' ','0');} static void sort(int[]a){m_sort(a,0,a.length,new int[a.length]);} static void sort(int[]a,int l){m_sort(a,0,l,new int[l]);} static void sort(int[]a,int l,int[]buf){m_sort(a,0,l,buf);} static void sort(int[]a,int s,int l,int[]buf){m_sort(a,s,l,buf);} static void m_sort(int[]a,int s,int sz,int[]b) {if(sz<7){for(int i=s;is&&a[j-1]>a[j];j--)swap(a, j, j-1);return;} m_sort(a,s,sz/2,b);m_sort(a,s+sz/2,sz-sz/2,b);int x=s;int l=s,r=s+sz/2;final int le=s+sz/2,re=s+sz; while(la[r])b[x++]=a[r++];else b[x++]=a[l++];} while(rs&&a[j-1]>a[j];j--)swap(a, j, j-1);return;} m_sort(a,s,sz/2,b);m_sort(a,s+sz/2,sz-sz/2,b);int x=s;int l=s,r=s+sz/2;final int le=s+sz/2,re=s+sz; while(la[r])b[x++]=a[r++];else b[x++]=a[l++];} while(rv)r=m-1;else{l=m+1;s=m;}}return s;} static int binarySearchSmallerMax(int[]a,int v,int l,int r) {int s=-1;while(l<=r){int m=(l+r)/2;if(a[m]>v)r=m-1;else{l=m+1;s=m;}}return s;} List[]randomTree(int n,Random r){List[]g=graph(n); for(int i=1;i[]graph(int n){List[]g=new List[n]; for(int i=0;i();return g;} void solve() throws NumberFormatException, IOException{ final int n = 5; Pos[] p = new Pos[n]; List list = new ArrayList<>(); for(int i=0; i=0) continue out; for(int j=1; j<2; j++){ int np = (i+3)%n; if(Line.ccw(p[d[i]], p[d[(i+1)%n]], p[d[np]])>=0) continue out; } } System.out.println("YES"); return; } System.out.println("NO"); } // // // public List convexHull(List list){ // int k = 0; // Collections.sort(list, new Sort()); // int n = list.size(); // int[][] qs = new int[n*2][2]; // for(int i=0; i 1 && cross(qs[k-2], qs[k-1], qs[k-1], list.get(i)) < 0) k--; // qs[k++] = list.get(i); // } // // for(int i=n-2, t=k; i>=0; i--){ // while(k > t && cross(qs[k-2], qs[k-1], qs[k-1], list.get(i)) < 0) k--; // qs[k++] = list.get(i); // } // // List res = new ArrayList(); // for(int i=0; i{ // @Override // public int compare(int[] o1, int[] o2) { // if(o1[0] != o2[0]) return o1[0]-o2[0]; // return o1[1]-o2[1]; // } // } // // public int cross(int[] p11, int[] p12, int[] p21, int[] p22){ // return (p12[0]-p11[0])*(p22[1]-p21[1]) - (p22[0]-p21[0])*(p12[1]-p11[1]); // } } class Permutation{ // max=10 // n=10: 160ms // n=11: 1600-1700ms int n; int max; BitSet used; int[] p; public Permutation(int n, int max){ this.n = n; this.max = max; used = new BitSet(n); p = new int[n]; } public boolean next(){ if(used.cardinality() == 0){ for(int i=0; i=0; i--){ used.clear(p[i]); if((used.nextClearBit(p[i]+1)) < max) break; } if(i<0) return false; p[i] = used.nextClearBit(p[i]+1); used.set(p[i]); int idx = i+1; for(i=used.nextClearBit(0); i{ static final double EPS = 1e-10; double x, y; public Pos(double x, double y){ this.x = x; this.y = y; } public double dist2(Pos p){ return (x-p.x)*(x-p.x) + (y-p.y)*(y-p.y); } @Override public int compareTo(Pos o) { if(Math.abs(x-o.x) >= EPS) return Double.compare(x, o.x); if(Math.abs(y-o.y) >= EPS) return Double.compare(y, o.y); return 0; } } class Line{ static final double EPS = 1e-10; Pos p1, p2; Pos vec; public Line(Pos p1, Pos p2){ this.p1 = p1; this.p2 = p2; vec = new Pos(p2.x-p1.x, p2.y-p1.y); } public Line(double x1, double y1, double x2, double y2){ p1 = new Pos(x1, y1); p2 = new Pos(x2, y2); vec = new Pos(x2-x1, y2-y1); } Pos crossPos(Line l){ if(!cross(p1, p2, l.p1, l.p2)) return null; double d1 = Math.abs(cross(l.vec.x, l.vec.y, p1.x-l.p1.x, p1.y-l.p1.y)); double d2 = Math.abs(cross(l.vec.x, l.vec.y, p2.x-l.p1.x, p2.y-l.p1.y)); double t = d1/(d1+d2); return new Pos(p1.x+(p2.x-p1.x)*t, p1.y+(p2.y-p1.y)*t); } boolean link(Line l){ return p1.compareTo(l.p1) == 0 || p1.compareTo(l.p2) == 0 || p2.compareTo(l.p1) == 0 || p2.compareTo(l.p2) == 0; } static boolean cross(Pos p1, Pos p2, Pos p3, Pos p4){ return ccw(p1, p2, p3) * ccw(p1, p2, p4) <= 0 && ccw(p3, p4, p1) * ccw(p3, p4, p2) <= 0; } static double cross(Pos a, Pos b){ return a.x*b.y - b.x*a.y; } public static double cross(double x1, double y1, double x2, double y2){ return x1*y2 - x2*y1; } // 上正座標で反時計回りが正 // 下正なら当然逆になる static double ccw(Pos a, Pos b, Pos c){ double dx1 = b.x - a.x; double dy1 = b.y - a.y; double dx2 = c.x - a.x; double dy2 = c.y - a.y; return dx1*dy2 - dx2*dy1; } public static double dist(Pos a, Pos b, Pos c){ // a->b からcへの距離 if(dot(b.x-a.x, b.y-a.y, c.x-a.x, c.y-a.y) < EPS) return Math.sqrt(a.dist2(c)); if(dot(a.x-b.x, a.y-b.y, c.x-b.x, c.y-b.y) < EPS) return Math.sqrt(b.dist2(c)); return Math.abs(ccw(a, b, c))/Math.sqrt(a.dist2(b)); } public double dist(Line l){ double res1 = Math.min(dist(p1, p2, l.p1), dist(p1, p2, l.p2)); double res2 = Math.min(dist(l.p1, l.p2, p1), dist(l.p1, l.p2, p2)); return Math.min(res1, res2); } public static double dot(double x, double y, double x1, double y2){ return x*x1 + y*y2; } } class MultiSet extends HashMap{ @Override public Integer get(Object key){return containsKey(key)?super.get(key):0;} public void add(T key,int v){put(key,get(key)+v);} public void add(T key){put(key,get(key)+1);} public void sub(T key){final int v=get(key);if(v==1)remove(key);else put(key,v-1);} public MultiSet merge(MultiSet set) {MultiSets,l;if(this.size()e:s.entrySet())l.add(e.getKey(),e.getValue());return l;} } class OrderedMultiSet extends TreeMap{ @Override public Integer get(Object key){return containsKey(key)?super.get(key):0;} public void add(T key,int v){put(key,get(key)+v);} public void add(T key){put(key,get(key)+1);} public void sub(T key){final int v=get(key);if(v==1)remove(key);else put(key,v-1);} public OrderedMultiSet merge(OrderedMultiSet set) {OrderedMultiSets,l;if(this.size(){ int a,b;final int hash;Pair(int a,int b){this.a=a;this.b=b;hash=(a<<16|a>>16)^b;} public boolean equals(Object obj){Pair o=(Pair)(obj);return a==o.a&&b==o.b;} public int hashCode(){return hash;} public int compareTo(Pair o){if(a!=o.a)return a