#include <cstdio>
#include <iostream>
#include <sstream>
#include <fstream>
#include <iomanip>
#include <algorithm>
#include <cmath>
#include <string>
#include <vector>
#include <list>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <bitset>
#include <numeric>
#include <limits>
#include <climits>
#include <cfloat>
#include <functional>
using namespace std;

class Point
{
public:
    int y, x;
    Point(){
        y = x = 0;
    }
    Point(int y0, int x0){
        y = y0;
        x = x0;
    }
    Point operator+(const Point& p) const{
        return Point(y + p.y, x + p.x);
    }
    Point operator-(const Point& p) const{
        return Point(y - p.y, x - p.x);
    }
    Point operator*(int a) const{
        return Point(y * a, x * a);
    }
    long long dot(const Point& p) const{
        return y * (long long)p.y + x * (long long)p.x; // |a|*|b|*cosθ
    }
    long long cross(const Point& p) const{
        return x * (long long)p.y - y * (long long)p.x; // |a|*|b|*sinθ
    }
    bool operator<(const Point& p) const{
        return make_pair(y, x) < make_pair(p.y, p.x);
    }
};

int main()
{
    vector<Point> p(5);
    for(int i=0; i<5; ++i)
        cin >> p[i].x >> p[i].y;
    sort(p.begin(), p.end());

    do{
        bool ok = true;
        for(int i=0; i<5; ++i){
            if((p[(i+1)%5] - p[i]).cross(p[(i+2)%5] - p[i]) <= 0)
                ok = false;
            for(int j=3; j<=4; ++j){
                if((p[(i+2)%5] - p[i]).cross(p[(i+j)%5] - p[i]) <= 0)
                    ok = false;
            }
        }
        if(ok){
            cout << "YES" << endl;
            return 0;
        }
    }while(next_permutation(p.begin(), p.end()));

    cout << "NO" << endl;
    return 0;
}