#include <bits/stdc++.h>
#define fi first 
#define se second
#define mp make_pair
#define bit(n) (1LL << (n))
#define getbit(x, i) (((x) >> (i)) & 1)
#define pii pair <int, int>
#define ALL(x) x.begin(), x.end()
using namespace std;
const int oo = 1e9;
const long long ooo = 1e18;

template<typename T1, typename T2> bool mini(T1 &a, T2 b) {
    if (a > b) {
        a = b;
        return true;
    }
    return false;
}

template<typename T1, typename T2> bool maxi(T1 &a, T2 b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}

int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    vector <pair <int, int>> dims(4);
    int sum = 0;
    for (auto &[w, h] : dims) {
        cin >> w >> h;
        sum += w * h;
    }

    int n = sqrt(sum);
    if (n * n != sum) {
        cout << "0\n";
        return 0;
    }

    vector <vector <int>> a(n + 1, vector <int> (n + 1, 0));

    for (int i = 0; i <= n; i++) {
        a[0][i] = a[i][0] = 1;
    }

    vector <bool> flag(4);

    function <void(int)> brute = [&](int cur) {
        if (cur == 4) {
            cout << "1\n";
            exit(0);
        }

        int rx = -1, ry = -1;
        for (int i = 1; i <= n; i++)
        for (int j = 1; j <= n; j++) if (!a[i][j] && a[i - 1][j] && a[i][j - 1]) {
            tie(rx, ry) = mp(i, j);
        }

        for (int ind = 0; ind < 4; ind++) if (!flag[ind]) {
            auto [w, h] = dims[ind];
            flag[ind] = true;
            for (int rep = 0; rep < 2; rep++) {
                bool ok = true;
                for (int i = rx; i < rx + h; i++)
                for (int j = ry; j < ry + w; j++) {
                    if (i > n || j > n || a[i][j]) {
                        ok = false;
                        break;
                    }
                }

                if (ok) {
                    for (int i = rx; i < rx + h; i++)
                    for (int j = ry; j < ry + w; j++) {
                        a[i][j] = 1;
                    }
                    brute(cur + 1);
                    for (int i = rx; i < rx + h; i++)
                    for (int j = ry; j < ry + w; j++) {
                        a[i][j] = 0;
                    }
                }
                swap(h, w);
            }
            flag[ind] = false;
        }
    };

    brute(0);

    cout << "0\n";
    
    return 0;
}