#include "bits/stdc++.h" using namespace std; #define FOR(i,j,k) for(int (i)=(j);(i)<(int)(k);++(i)) #define rep(i,j) FOR(i,0,j) #define each(x,y) for(auto &(x):(y)) #define mp make_pair #define all(x) (x).begin(),(x).end() #define debug(x) cout<<#x<<": "<<(x)< pii; typedef vector vi; typedef vector vll; #define EPS 1e-8 class V2{ public: double x, y; V2(){} V2(double x_, double y_):x(x_),y(y_){} bool operator<(const V2 &p) const{ return x!=p.x?x EPS) return +1; if(cross(b, c) < -EPS) return -1; if(dot(b, c) < -EPS) return +2; if (b.dist() < c.dist()) return -2; return 0; } vector convexHull(vector ps){ int n = (int)ps.size(); sort(begin(ps), end(ps)); int k = 0; vector qs(n*2); for(int i=0; i 1 && ccw(qs[k-2], qs[k-1], ps[i]) <= 0) k--; qs[k++] = ps[i]; } for(int i=n-2, t=k; i>=0; --i){ while(k>t && ccw(qs[k-2], qs[k-1], ps[i]) <= 0) k--; qs[k++] = ps[i]; } qs.resize(k-1); return qs; } int main(){ vector ps(5); rep(i, 5)cin >> ps[i].x >> ps[i].y; int num = sz(convexHull(ps)); if(num == 5)cout << "YES" << endl; else cout << "NO" << endl; }