#include <bits/stdc++.h>

using namespace std;
using ll = long long;

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    vector<array<int, 2>> a(4);
    int area = 0;
    for (auto &[x, y] : a) {
        cin >> x >> y;
        area += x * y;
    }

    int sq = sqrt(area) + 5;
    while (sq * sq > area)
        sq--;
    if (sq * sq != area) {
        cout << "0\n";
        return 0;
    }

    auto check = [sq](vector<array<int, 2>> a) {
        sort(begin(a), end(a));

        do {
            if (a[0][1] == sq && a[3][1] == sq && a[1][0] == a[2][0] &&
                a[1][1] + a[2][1] == sq && a[0][0] + a[1][0] + a[2][0] == sq) {
                return true;
            }

            if (a[2][1] == sq && a[3][1] == sq && a[1][0] == a[0][0] &&
                a[1][1] + a[0][1] == sq && a[0][0] + a[2][0] + a[3][0] == sq) {
                return true;
            }

            if (a[0][0] == a[2][0] && a[1][0] == a[3][0] && a[0][0] + a[1][0] == sq &&
                a[0][1] + a[2][1] == sq && a[1][1] + a[3][1] == sq) {
                return true;
            }

            if (a[3][1] == sq && a[3][0] + a[2][0] == sq &&
                a[0][0] + a[1][0] == a[2][0] && a[0][1] == a[1][1] &&
                a[0][1] + a[2][1] == sq) {
                return true;
            }

            if (a[3][1] == sq && a[0][0] == a[1][0] && a[0][0] == a[2][0] &&
                a[0][0] + a[3][0] == sq && a[0][1] + a[1][1] + a[2][1] == sq) {
                return true;
            }
        } while (next_permutation(begin(a), end(a)));
        return false;
    };

    for (int msk = 0; msk < (1 << 4); msk++) {
        for (int b = 0; b < 4; b++) {
            if (msk >> b & 1) {
                swap(a[b][0], a[b][1]);
            }
        }

        if (check(a)) {
            cout << "1\n";
            return 0;
        }

        for (int b = 0; b < 4; b++) {
            if (msk >> b & 1) {
                swap(a[b][0], a[b][1]);
            }
        }
    }

    cout << 0 << endl;
    return 0;
}