#include <bits/stdc++.h>
using namespace std;
using ll=long long;
using ld=long double;
const ll ILL=2167167167167167167;
const int INF=2100000000;
#define rep(i,a,b) for (int i=(int)(a);i<(int)(b);i++)
#define all(p) p.begin(),p.end()
template<class T> using _pq = priority_queue<T, vector<T>, greater<T>>;
template<class T> int LB(vector<T> &v,T a){return lower_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> int UB(vector<T> &v,T a){return upper_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> bool chmin(T &a,T b){if(b<a){a=b;return 1;}else return 0;}
template<class T> bool chmax(T &a,T b){if(a<b){a=b;return 1;}else return 0;}
template<class T> void So(vector<T> &v) {sort(v.begin(),v.end());}
template<class T> void Sore(vector<T> &v) {sort(v.begin(),v.end(),[](T x,T y){return x>y;});}
bool yneos(bool a,bool upp=false){if(a){cout<<(upp?"YES\n":"Yes\n");}else{cout<<(upp?"NO\n":"No\n");}return a;}
template<class T> void vec_out(vector<T> &p,int ty=0){
    if(ty==2){cout<<'{';for(int i=0;i<(int)p.size();i++){if(i){cout<<",";}cout<<'"'<<p[i]<<'"';}cout<<"}\n";}
    else{if(ty==1){cout<<p.size()<<"\n";}for(int i=0;i<(int)(p.size());i++){if(i) cout<<" ";cout<<p[i];}cout<<"\n";}}
template<class T> T vec_min(vector<T> &a){assert(!a.empty());T ans=a[0];for(auto &x:a) chmin(ans,x);return ans;}
template<class T> T vec_max(vector<T> &a){assert(!a.empty());T ans=a[0];for(auto &x:a) chmax(ans,x);return ans;}
template<class T> T vec_sum(vector<T> &a){T ans=T(0);for(auto &x:a) ans+=x;return ans;}
int pop_count(long long a){int res=0;while(a){res+=(a&1),a>>=1;}return res;}

struct point{
    ll x;
    ll y;
};

ll dist(point a, point b){
    return (a.x - b.x) * (a.x - b.x) + (a.y - b.y) * (a.y - b.y);
}

void solve();
// CITRUS CURIO CITY / FREDERIC
int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int t = 1;
    // cin >> t;
    rep(i, 0, t) solve();
}

void solve(){
    vector<point> p(4);
    rep(i, 0, 4) cin >> p[i].x >> p[i].y;
    int ans1 = 0, ans2 = 0, ans3 = 0;
    auto my_cos = [&](point a, point b, point c) -> pair<ll, ll> {
        return {dist(a, b) + dist(a, c) - dist(b, c), 4ll * dist(a, b) * dist(a, c)};
    };
    auto f = [&](point a, point b, point c, point d) -> void {
        auto A = my_cos(c, a, b);
        auto B = my_cos(d, a, b);
        if (A.first * A.first == A.second) ans1 = INF;
        if (B.first * B.first == B.second) ans1 = INF;
        if (A.first * A.first * B.second == B.first * B.first * A.second){
            if (A.first == 0) ans3 = 1;
            else if ((A.first < 0) ^ (B.first < 0)) ans2++;
            else ans1++;
        }
    };
    f(p[0], p[1], p[2], p[3]);
    f(p[0], p[2], p[3], p[1]);
    f(p[0], p[3], p[1], p[2]);
    f(p[1], p[2], p[0], p[3]);
    f(p[1], p[3], p[0], p[2]);
    f(p[2], p[3], p[0], p[1]);
    yneos((ans1 == 4 && ans2 == 2) || ans3 == 1, true);
}