// Hallelujah, praise the one who set me free
// Hallelujah, death has lost its grip on me
// You have broken every chain, There's salvation in your name
// Jesus Christ, my living hope
#include <bits/stdc++.h> 
using namespace std;

#define REP(i, s, e) for (int i = (s); i < (e); i++)
#define RREP(i, s, e) for (int i = (s); i >= (e); i--)
template <class T>
inline bool mnto(T& a, T b) {return a > b ? a = b, 1 : 0;}
template <class T>
inline bool mxto(T& a, T b) {return a < b ? a = b, 1: 0;}
typedef long long ll;
typedef long double ld;
#define FI first
#define SE second
typedef pair<int, int> ii;
typedef pair<ll, ll> pll;
typedef tuple<int, int, int> iii;
#define ALL(_a) _a.begin(), _a.end()
#define SZ(_a) (int) _a.size()
#define pb push_back
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<ii> vii;
typedef vector<iii> viii;

#ifndef DEBUG
#define cerr if (0) cerr
#endif

const int INF = 1000000005;
const ll LINF = 1000000000000000005ll;
const int MAXN = 2005;

ii wh[4];

int memo[1 << 4][MAXN][MAXN];
bool solve(int msk, int n, int m) {
    if (msk == 0) {
        if (n == 0 || m == 0) {
            return 1;
        } else {
            return 0;
        }
    }
    if (memo[msk][n][m] != -1) {
        return memo[msk][n][m];
    }
    /*
    if (SZ(wh) == 1) {
        auto [w, h] = wh[0];
        if (min(w, h) == min(n, m) && max(w, h) == max(n, m)) {
            return 1;
        } else {
            return 0;
        }
    }
    */
        cerr << bitset<4>(msk) << ' ' << n << ' ' << m << '\n';
    REP (i, 0, 4) {
        if (msk >> i & 1 ^ 1) {
            continue;
        }
        auto [w, h] = wh[i];
        REP (z, 0, 2) {
            swap(w, h);
            if (w > n || h > m) {
                continue;
            }
            int nmsk = msk ^ (1 << i);
            for (int k = nmsk; ; k = (k - 1) & nmsk) {
                bool res = (solve(k, n - w, m) && solve(nmsk ^ k, w, m - h)) ||
                    (solve(k, n - w, h) && solve(nmsk ^ k, n, m - h));
                if (res) {
                    return memo[msk][n][m] = 1;
                }
                if (k == 0) {
                    break;
                }
            }
        }
    }
    return memo[msk][n][m] = 0;
}

int main() {
#ifndef DEBUG
    ios::sync_with_stdio(0), cin.tie(0);
#endif
    int area = 0;
    REP (i, 0, 4) {
        int w, h; cin >> w >> h;
        wh[i] = {w, h};
        area += w * h;
    }
    int sq = -1;
    REP (i, 1, area + 1) {
        if ((ll) i * i == area) {
            sq = i;
            break;
        }
    }
    if (sq == -1) {
        cout << 0 << '\n';
        return 0;
    }
    memset(memo, -1, sizeof memo);
    cout << solve((1 << 4) - 1, sq, sq) << '\n';
    return 0;
}