#include <bits/stdc++.h>
using namespace std;

#ifdef CKISEKI
#define safe cerr << __PRETTY_FUNCTION__ << " line " << __LINE__ << " safe\n"
#define debug(a...) debug_(#a, a)
#define orange(a...) orange_(#a, a)
template <typename ...T>
void debug_(const char *s, T ...a) {
    cerr << "\e[1;32m(" << s << ") = (";
    int cnt = sizeof...(T);
    (..., (cerr << a << (--cnt ? ", " : ")\e[0m\n")));
}
template <typename I>
void orange_(const char *s, I L, I R) {
    cerr << "\e[1;32m[ " << s << " ] = [ ";
    for (int f = 0; L != R; ++L)
        cerr << (f++ ? ", " : "") << *L;
    cerr << " ]\e[0m\n";
}
#else
#define safe ((void)0)
#define debug(...) ((void)0)
#define orange(...) ((void)0)
#endif

int main() {
    cin.tie(nullptr)->sync_with_stdio(false);
    int a[4][2];
    for (int i = 0; i < 4; i++) {
        cin >> a[i][0] >> a[i][1];
    }

    int ok = 0;

    for (int iter = 0; iter < 2; iter++) {
        int p[4] = {0, 1, 2, 3};
        do {
            auto A = a[p[0]];
            auto B = a[p[1]];
            auto C = a[p[2]];
            auto D = a[p[3]];

            if (A[0] == B[0] && B[0] == C[0] && A[1] + B[1] + C[1] == D[1] && D[1] == A[0] + D[0])
                ok = 1;
            if (A[0] == B[0] && C[0] == D[0] && A[1] + B[1] == C[1] + D[1] && A[1] + B[1] == A[0] + C[0])
                ok = 1;
            if (A[0] == B[0] && B[0] == C[0] && C[0] == D[0] && A[0] == A[1]+B[1]+C[1]+D[1])
                ok = 1;
            if (A[1] == B[1] && A[0] + B[0] == C[0] && A[1] + C[1] == D[1] && D[1] == C[0] + D[0])
                ok = 1;

            if (A[0] == B[0] && A[1] + B[1] == C[1] && C[1] == D[1] && C[0] + D[0] + A[0] == A[1] + B[1])
                ok = 1;

            if (A[1] == B[1] && A[0] + B[0] == C[0] && C[0] == D[0] && A[1] + C[1] + D[1] == C[0])
                ok = 1;


            for (int i = 0; i < 4; i++)
                swap(a[i][0], a[i][1]);
        } while (next_permutation(p, p+4));
    }

    cout << ok << '\n';

    return 0;
}