//#pragma GCC optimize("Ofast", "unroll-loops")
//#pragma GCC target("sse", "sse2", "sse3", "ssse3", "sse4")

#ifdef __APPLE__

#include <iostream>
#include <cmath>
#include <algorithm>
#include <stdio.h>
#include <cstdint>
#include <cstring>
#include <string>
#include <cstdlib>
#include <vector>
#include <bitset>
#include <map>
#include <queue>
#include <ctime>
#include <stack>
#include <set>
#include <list>
#include <random>
#include <deque>
#include <functional>
#include <iomanip>
#include <sstream>
#include <fstream>
#include <complex>
#include <numeric>
#include <cassert>
#include <array>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <thread>

#else
#include <bits/stdc++.h>
#endif

#define all(a) a.begin(),a.end()
#define len(a) (int)(a.size())
#define mp make_pair
#define pb push_back
#define fir first
#define sec second
#define fi first
#define se second

using namespace std;

typedef pair<int, int> pii;
typedef long long ll;
typedef long double ld;

template<typename T>
bool umin(T &a, T b) {
    if (b < a) {
        a = b;
        return true;
    }
    return false;
}

template<typename T>
bool umax(T &a, T b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}

#if __APPLE__
#define D for (bool _FLAG = true; _FLAG; _FLAG = false)
#define LOG(...) print(#__VA_ARGS__" ::", __VA_ARGS__) << endl

template<class ...Ts>
auto &print(Ts ...ts) { return ((cerr << ts << " "), ...); }

#else
#define D while (false)
#define LOG(...)
#endif

const int max_n = -1, inf = 1000111222;

//mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

int a[4], b[4];
bool u[4];

vector<array<int, 4> > on;

int side = 0;

void go(int x, int y) {
    if(x == side) {
        if(y == side - 1) return;
        go(0, y + 1);
    }
    bool bad = false;
    for(auto& cr : on)
        bad |= (cr[0] <= x && x <= cr[1] && cr[2] <= y && y <= cr[3]);
    if(bad) go(x + 1, y);
    else {
        for(int to_use = 0; to_use < 4; to_use++) {
            if(u[to_use]) continue;
            for(int it = 0; it < 2; it++) {
                int x1 = x, y1 = y;
                int x2 = x1 + a[to_use] - 1;
                int y2 = y1 + b[to_use] - 1;
                bool bad_use = (x2 >= side || y2 >= side);
                for(auto& cr : on) {
                    int mnx = max(x1, cr[0]), mxx = min(x2, cr[1]);
                    int mny = max(y1, cr[2]), mxy = min(y2, cr[3]);
                    bad_use |= (mnx <= mxx && mny <= mxy);
                }
                if(!bad_use) {
                    u[to_use] = true;
                    on.pb({x1, x2, y1, y2});
                    if(len(on) == 4) {
                        cout << "1\n";
                        exit(0);
                    }
                    go(x + 1, y);
                    on.pop_back();
                    u[to_use] = false;
                }
                swap(a[to_use], b[to_use]);
            }
        }
    }
}

void solve() {
    int sum = 0;
    for(int i = 0; i < 4; i++) {
        cin >> a[i] >> b[i];
        sum += a[i] * b[i];
    }
    while(side * side < sum) side++;
    if(side * side != sum) { cout << "0\n"; return; }
    go(0, 0);
    cout << "0\n";
}

signed main() {
//   freopen("input.txt", "r", stdin);
//   freopen("output.txt", "w", stdout);

    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);

    int t = 1;

    //cin >> t;

    while (t--) solve();

}

/*
KIVI
*/