#include <bits/stdc++.h>

using namespace std;

#ifdef LOCAL
template <class... T> void dbg(T... x) { char e{}; ((cerr << e << x, e = ' '), ...); }
template <class T> void org(T l, T r) { while (l != r) cerr << ' ' << *l++; cerr << '\n'; }
#define debug(x...) dbg(#x, '=', x, '\n')
#define olist(x...) dbg(#x, '='), org(x)
#else
#define debug(...) ((void)0)
#define olist(...) ((void)0)
#endif
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define ff first
#define ss second

using u32 = unsigned int;
using i64 = long long;
using u64 = unsigned long long;
using i128 = __int128;
using u128 = unsigned __int128;
using Pt = pair<int, int>;

template <class T> inline constexpr T inf = numeric_limits<T>::max() / 2;
constexpr int mod = 1e9 + 7;

template<class T> bool chmin(T &a, T b) { return (b < a and (a = b, true)); }
template<class T> bool chmax(T &a, T b) { return (a < b and (a = b, true)); }
template<class... T> int add(T... x) { int t{}; return (((t += x) %= mod), ...), t; }
template<class... T> int mul(T... x) { i64 t{1}; return (((t *= x) %= mod), ...), t; }

void solve() {
    vector<pair<int, int>> R(4);
    int are = 0;
    for (auto &[a, b] : R) {
        cin >> a >> b;
        are += a * b;
        if (a > b) swap(a, b);
    }

    sort(all(R));

    int r = sqrt(are);
    while (r * r < are) r++;

    if (r * r != are) {
        cout << 0 << '\n';
        return;
    }


    function<bool(int, int, int)> rec = [&](int x, int y, int s) -> bool {
        // debug(a, b, s);
        if (x * y == 0 and s == 0) return true;
        for (auto [a, b] : vector<pair<int, int>>{{x, y}, {y, x}}) {
            for (int i = 0; i < 4; i++)
                if (s >> i & 1) {
                    if (a == R[i].ff) {
                        if (rec(a, b - R[i].ss, s - (1 << i)))
                            return true;
                    }
                    if (a == R[i].ss) {
                        if (rec(a, b - R[i].ff, s - (1 << i)))
                            return true;
                    }
                }
        }
        return false;
    };
    
    for (int i = 1; i < r; i++) {
        for (int a = 1; a < 4; a++) {
            int x = 1 + (1 << a);
            int y = (1 << 4) - 1 - x;
            if (rec(r, i, x) and rec(r, r - i, y)) {
                cout << 1 << '\n';
                return;
            }
            if (rec(r, i, y) and rec(r, r - i, x)) {
                cout << 1 << '\n';
                return;
            }
        }
    }

    cout << rec(r, r, 0b1111) << '\n';
}

signed main() {
    cin.tie(0)->sync_with_stdio(false);
    cin.exceptions(cin.failbit);
    int T = 1;
    // cin >> T;
    while (T--) {
        solve();
    }
    return 0;
}