/// Msaa el 5ra
#pragma GCC optimize("O3")
#pragma GCC optimize ("unroll-loops")
#pragma GCC target("avx,avx2,fma")

#include "bits/stdc++.h"

using namespace std;

#define pb push_back
#define F first
#define S second
#define f(i, a, b)  for(int i = a; i < b; i++)
#define all(a)  a.begin(),a.end()
#define rall(a) a.rbegin(),a.rend()
#define popCnt(x) (__builtin_popcountll(x))
#define int ll

using ll = long long;
using ii = pair<int, int>;
using ull = unsigned long long;

const int N = 1e6 + 5, LG = 18, MOD = (119 << 23) + 1;
const long double PI = acos(-1);
const long double EPS = 1e-7;

vector<ii> vp;

bool solve4(vector<ii> vp) {
    f(i, 0, 4)if (vp[i].F != vp[0].F)return false;
    int sum = 0;
    f(i, 0, 4)sum += vp[i].S;
    return vp[0].F == sum;
}

bool solve13(vector<ii> vp) {
    int sum = 0;
    f(i, 1, 4)sum += vp[i].S;
    f(i, 1, 3)if (vp[i].F != vp[1].F)return false;
    return (sum == vp[1].S && (vp[0].F + vp[1].F == vp[0].S));
}

bool solve22(vector<ii> vp) {
    if (vp[0].F != vp[1].F)return false;
    if (vp[2].F != vp[3].F)return false;
    if (vp[0].S + vp[1].S != vp[2].S + vp[3].S)return false;
    return (vp[0].F + vp[2].F == vp[0].S + vp[1].S);
}

bool calc(vector<ii> vp) {
    sort(all(vp));
    do {
        if (solve4(vp))return true;
        if (solve13(vp))return true;
        if (solve22(vp))return true;
    } while (next_permutation(all(vp)));
    return false;
}

void doWork() {
    vp.resize(4);
    f(i, 0, 4) {
        cin >> vp[i].F >> vp[i].S;
    }
    f(m, 0, 1 << 4) {
        f(i, 0, 4)if (m >> i & 1)swap(vp[i].F, vp[i].S);
        if (calc(vp)) {
            cout << "1\n";
            return;
        }
        f(i, 0, 4)if (m >> i & 1)swap(vp[i].F, vp[i].S);
    }
    cout << "0\n";
}

int32_t main() {
#ifdef ONLINE_JUDGE
    ios_base::sync_with_stdio(0);
    cin.tie(0);
#endif // ONLINE_JUDGE
    int t = 1;
//    cin >> t;
    while (t--) {
        doWork();
    }
}