#include <bits/stdc++.h>
using namespace std;
int  n , m;
typedef pair<int,int> pii;
typedef long long ll;
pii s[4];
int st[4];
bool used[4];
bool sol = 0;
int w = -1 ,h = -1;
bool chk() {
    pii ns[4] ;
    for(int i = 0;i < 4;i++) {
        if(st[i] & 1) ns[i] = {s[i].second , s[i].first} ;
        else ns[i] = s[i];
    }
    map<pii,int> mp;
    mp[{0,0}] = 0 ; mp[{0 , w}] = 0;mp[{w , 0}] = 0;mp[{w , w}] = 0;
    for(int i = 0;i < 4;i++) {
        pii tl ;
        int cur = (st[i] >> 1);
        if(cur == 0) tl = {0 , 0};
        else if(cur == 1) tl = {0 , w - ns[i].second} ;
        else if(cur == 2) tl = {w - ns[i].first, 0};
        else tl = {w - ns[i].first , w - ns[i].second};
        mp[tl]++ ;
        mp[{tl.first + ns[i].first , tl.second}]--;
        mp[{tl.first , tl.second + ns[i].second}]--;
        mp[{tl.first + ns[i].first , tl.second + ns[i].second}]++ ;
    }
    for(auto &[u,v] : mp) {
        if(u == (pii){0,0} || u == (pii){w,w}) {
            if(v != 1) return 0;
        }
        else if(u == (pii){0,w} || u == (pii){w,0}) {
            if(v != -1) return 0;
        }
        else {
            if(v != 0) return 0;
        }
    }
    return 1;
}
void dfs(int u) {
    if(u == 4) {
        sol |= chk() ;
        return ;
    }
    for(int i = 0;i < 8;i++) {
        st[u] = i;dfs(u + 1);
    }
    return ;
}
int lw , lh;
void ddfs(int u) {
    if(u == 4) {
        if(lw == 0 || lh == 0) sol = 1;
        return ;
    }
    // printf("in %d %d %d\n",u,lw,lh) ;
    for(int i = 0;i < 4;i++) {
        if(used[i]) continue ;
        // printf("%d %d\n",s[i].first,s[i].second) ;
        if(s[i].first == lw) {
            used[i] = 1 ; 
            lh -= s[i].second ;
            ddfs(u + 1) ;
            lh += s[i].second ;
            used[i] = 0;
        }
        if(s[i].first == lh) {
            used[i] = 1 ; 
            lw -= s[i].second ;
            ddfs(u + 1) ;
            lw += s[i].second ;
            used[i] = 0;
        }
        if(s[i].second == lw) {
            used[i] = 1 ; 
            lh -= s[i].first ;
            ddfs(u + 1) ;
            lh += s[i].first;
            used[i] = 0;
        }
        if(s[i].second == lh) {
            used[i] = 1 ; 
            lw -= s[i].first ;
            ddfs(u + 1) ;
            lw += s[i].first;
            used[i] = 0;
        }
    }
}
int main() {
    ios::sync_with_stdio(false) ; cin.tie(0) ; cout.tie(0) ;
    ll ans = 0;
    for(int i = 0;i < 4;i++) {cin >> s[i].first >> s[i].second ; ans += 1LL * s[i].first * s[i].second ;}
    int d = sqrt(ans) ;
    
    for(int i = max(1 , d - 1) ; i <= d + 1;i++) {
        if(1LL * i * i == ans) {
            w = i;h = i;
        }
    }
    if(w == -1) {cout << 0 ; return 0;}
    
    dfs(0) ;
    if(sol) {
        cout << 1 ; return 0;
    }
    lw = w ; lh = w;
    ddfs(0) ;
    cout << sol ;
    return 0;
}