#include <bits/stdc++.h>
using namespace std;
#define _ <<" "<<
#define sz(x) ((int) (x).size())
typedef pair<int, int> pii;
typedef long long ll;
const int maxn = 5e5 + 5;


int n, m;

bool solve(int x,int y, vector<pii> A) {
    if (x <= 0 || y <= 0) return false;
    if (sz(A) == 1) {
        pii s = A[0];
        return s.first == x && s.second == y || s.second == x && s.first == y;
    }
    for (int k = 0;k < sz(A); ++k) if (A[k].first <= x && A[k].second <= y) {
        vector<pii> rest;
        for (int i = 0;i < sz(A); ++i) if (i != k) rest.push_back(A[i]);

        auto distri = [&](pii na,pii nb) {
            if (nb.first == 0 || nb.second == 0) {
                return solve(na.first,na.second,rest);
            }
            if (na.first == 0 || na.second == 0) {
                return solve(nb.first,nb.second,rest);
            }
            for (int t = 0;t < sz(rest); ++t) {
                vector<pii> ra, rb;
                ra.push_back(rest[t]);
                for (int j = 0;j < sz(rest); ++j) if (j != t) {
                    rb.push_back(rest[j]);
                }
                if (solve(na.first,na.second,ra) && solve(nb.first,nb.second,rb)) return true;
            }
            return false;
        };
        pii na = {x-A[k].second, A[k].first}, nb = {y-A[k].first,x};
        if (distri(na,nb)) return true;
        na = {x-A[k].second,y}; nb = {A[k].second,y-A[k].first};
        if (distri(na,nb)) return true;
        na = {x-A[k].first,A[k].second}; nb = {y-A[k].second,x};
        if (distri(na,nb)) return true;
        na = {x-A[k].first,y}; nb = {y-A[k].second,A[k].first};
        if (distri(na,nb)) return true;
    }
    return false;
}

int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    vector<pii> sq;
    vector<int> val;
    for (int i = 1;i <= 4; ++i) {
        int x,y; cin >> x >> y;
        sq.push_back({x,y});
        val.push_back(x); val.push_back(y);
    }
    int len = sz(val);
    for (int i = 0;i < len; ++i) {
        for (int j = i+1;j < len; ++j) {
            val.push_back(val[i]+val[j]);
        }
    }
    sort(val.begin(),val.end());
    val.erase(unique(val.begin(),val.end()),val.end());
    for (auto x : val) {
        if (solve(x,x,sq)) {
            cout << "1" << '\n';
            return 0;
        }
    }
    cout << '0' << '\n';
    return 0;
}