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

using ll = long long;
// #define int ll
#define all(v) (v).begin(), (v).end()
#define pb push_back

void dbg_out() { cerr << endl; }
template<typename H, typename... T> 
void dbg_out(H h, T... t) { cerr << ' ' << h; dbg_out(t...); }
#define dbg(...) { cerr << #__VA_ARGS__ << ':'; dbg_out(__VA_ARGS__); }

int raiz (int x) {
    int y = max<int> (0, sqrt (x) - 2);
    while (y * y < x) y++;
    return y;
}

void solve() {
    int area = 0;
    vector<pair<int, int>> a (4);
    for (auto &[x, y] : a) cin >> x >> y, area += x * y;

    int l = raiz (area);
    if (l * l != area) {
        cout << "0\n";
        return;
    }

    // dbg (l);

    vector<int> perm (4);
    iota (all (perm), 0);

    vector tab (l, vector<int> (l));
    auto reset = [&] () {
        for (int i = 0; i < l; i++)
            for (int j = 0; j < l; j++)
                tab[i][j] = 0;
    };
    do {
        // for (auto u : perm) cout << u << " ";
        // cout << "\n";
        // dbg ("A");
        for (int mask = 0; mask < 8; mask++) {
            reset ();
            bool ok = true;
            int k = 0;
            for (int i = 0; i < l && ok; i++) {
                for (int j = 0; j < l && ok; j++) if (!tab[i][j]) {
                    // se nao pintamos
                    int u = perm[k];
                    auto [x, y] = a[perm[k]];
                    if (mask & (1 << k)) swap (x, y);
                    k++;
                    // vamos colocar o quadrado x, y
                    if (i + x > l || j + y > l) {
                        ok = false;
                        break;
                    }
                    // dbg (i, j, x, y);
                    for (int ii = i; ii < i + x; ii++)
                        for (int jj = j; jj < j + y; jj++) {
                            if (tab[ii][jj]) ok = false;
                            else tab[ii][jj] = 1;
                        }
                    j += y - 1;
                }
            }
            if (ok) {
                // for (int i = 0; i < l; i++)
                //     for (int j = 0; j < l; j++) cout << tab[i][j] << " \n"[j == l - 1];
                // for (auto u : perm) cout << u << " ";
                // cout << "\n";
                cout << "1\n";
                return;
            }
        }
    } while (next_permutation (all (perm))); 
    cout << "0\n";
}

signed main() {
    ios::sync_with_stdio(false); cin.tie(0);
    solve();
}