#include <bits/stdc++.h>
#ifdef LOCAL
// #define debug(...) 42
#include "cp_debug.h"
#else
#define debug(...) 42
#endif
#define rep(i,a,b) for(int i = a; i < b; ++i)
#define all(x) begin(x), end(x)
#define sz(x) (int)x.size()
using namespace std;
#define int long long

typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef vector<int> vi;
typedef vector<ll> vl;

template<typename T> void read(T &x){
    x = 0;char ch = getchar();ll f = 1;
    while(!isdigit(ch)){if(ch == '-')f*=-1;ch=getchar();}
    while(isdigit(ch)){x = x*10+ch-48;ch=getchar();}x*=f;
}
template<typename T, typename... Args> void read(T &first, Args& ... args) {
    read(first);
    read(args...);
}
template<typename T> void write(T x) {
    if(x > 9) write(x/10);
    putchar(x%10 + '0');
}

set<pii> combine(set<pii> r1, set<pii> r2) {
    set<pii> possible;
    auto add = [&](int x, int y) {
        possible.emplace(min(x, y), max(x, y));
    };
    for(auto [w1, h1]: r1) {
        for(auto [w2, h2]: r2) {
            if(w1 == w2) {
                add(w1, h1+h2);
            }
            if(w1 == h2) {
                add(w1, h1+w2);
            }
            if(h1 == w2) {
                add(h1, w1+h2);
            }
            if(h1 == h2) {
                add(h1, w1+w2);
            }
        }
    }
    return possible;
}
bool check(set<pii> possible) {
    for(auto [w, h]: possible) {
        if(w == h) {
            debug(w,h);
            return true;
        }
    }
    return false;
}
void solve() {
    int w[4] = {}, h[4] = {}, sum = 0;
    set<pii> r[4];
    rep(i,0,4) {
        read(w[i], h[i]);
        sum += w[i]*h[i];
        r[i].emplace(min(h[i], w[i]), max(h[i], w[i]));
    }
    int leng = sqrt(sum), ok = false;
    for(int i = max(1LL,leng-3); i <= leng+3; i++) if(i*i == sum) {
        ok = true;
    }
    if(!ok) {
        cout<<0<<endl;
        return;
    }
    auto r01 = combine(r[0], r[1]);
    auto r23 = combine(r[2], r[3]);
    if(check(combine(r01, r23))) {
        cout<<1<<'\n';
        return;
    }
    auto r02 = combine(r[0], r[2]);
    auto r13 = combine(r[1], r[3]);
    if(check(combine(r02, r13))) {
        cout<<1<<'\n';
        return;
    }
    vi perm = {0,1,2,3};
    do {
        debug(perm);
        auto c = r[perm[0]];
        rep(i,1,4) {
            c = combine(c, r[perm[i]]);
        }
        if(check(c)) {
            cout<<1<<'\n';
            return;
        }
    } while(next_permutation(all(perm)));
    cout<<0<<'\n';
}

// akt+kb==ct+d
signed main() {
    int T; T=1;
    while(T--) solve();
    return 0;
}