#pragma ide diagnostic ignored "misc-no-recursion"

#include "bits/stdc++.h"

using namespace std;
typedef long long ll;
typedef double db;
typedef pair<int, int> pii;

#define TESTCASE 0

static constexpr int MAXN = 1e6 + 5;

bool check2(int h, int w, array<pii, 2> rects) {
    const auto ch = [&rects](int h, int w) -> bool {
        auto [r, s] = rects;
        if (r.second == h)
            swap(r.first, r.second);
        if (s.second == h)
            swap(s.first, s.second);
        return (r.first == h && s.first == h && r.second + s.second == w);
    };
    return ch(h, w) || ch(w, h);
}

bool check3(int h, int w, array<pii, 3> rects) {
    array<pii, 2> tmp2;
    bool ans = false;
    for (int i = 0; i < 3; ++i) {
        auto [a, b] = rects[i];
        for (int j = 0; j < 3; j++)
            if (i != j)
                tmp2[j - (j > i)] = rects[j];
        ans |= (a == h && check2(h, w - b, tmp2));
        ans |= (a == w && check2(w, h - b, tmp2));
        swap(a, b);
        ans |= (a == h && check2(h, w - b, tmp2));
        ans |= (a == w && check2(w, h - b, tmp2));
        if (ans)
            return true;
    }
    return false;
}

static void solve([[maybe_unused]] int tc) {
    array<pii, 4> panes;
    int area = 0;
    for (int i = 0, a, b; i < 4; i++) {
        cin >> a >> b;
        if (a > b)
            swap(a, b);
        panes[i] = {a, b};
        area += a * b;
    }
    int side = sqrt(area);
    if (side * side != area) {
        cout << "0\n";
        return;
    }
    for (int i = 0; i < 4; ++i)
        if (panes[i].second > side) {
            cout << "0\n";
            return;
        }

    array<pii, 3> tmp3;
    for (int i = 0; i < 4; i++) {
        const auto [a, b] = panes[i];
        for (int j = 0; j < 4; j++)
            if (i != j)
                tmp3[j - (j > i)] = panes[j];
        if (b == side && check3(side - a, side, tmp3)) {
            cout << "1\n";
            return;
        }
    }

    array<pii, 2> tmp2;
    for (int i = 0; i < 4; ++i) {
        for (int j = i + 1; j < 4; ++j) {
            for (int k = 0; k < 4; ++k)
                if (k != j && k != i)
                    tmp2[k - (k > i) - (k > j)] = panes[k];
            const pii p = panes[i], q = panes[j];
            bool pq = check2(p.first, side, {p, q}) && check2(side - p.first, side, tmp2);
            bool qp = check2(p.second, side, {p, q}) && check2(side - p.second, side, tmp2);
            if (pq || qp) {
                cout << "1\n";
                return;
            }
        }
    }

    cout << "0\n";
}

int main() {
    ios::sync_with_stdio(false);

    if (const char *f = getenv("REDIRECT_STDOUT"); f) {
        freopen(f, "w", stdout);
    }

    int T = 1;
#if TESTCASE
    cin >> T;
#endif

    for (int t = 1; t <= T; t++) {
        solve(t);
    }

    return 0;
}