#include <bits/stdc++.h>

typedef long long ll;
#define int ll

#define pb push_back
#define fi first
#define se second

using namespace std;

void solve(int a, int b, const vector<pair<int, int> >& v, int id)
{
    if (id == 0)
    {
        if (a == v[id].fi && b == v[id].se)
        {
            cout<<"1\n";
            exit(0);
        }
        return;
    }

    if (v[id].fi == a)
        solve(a, b-v[id].se, v, id-1);
    if (v[id].se == b)
        solve(a-v[id].fi, b, v, id-1);
}

void solve2(int a, vector<pair<int, int> > v)
{
    if (v[0].fi + v[1].fi == a && v[1].se + v[2].se == a && v[2].fi + v[3].fi == a && v[3].se + v[0].se == a)
    {
        cout<<"1\n";
        exit(0);
    }

    solve(a, a, v, 3);
}

void solve(int a, vector<pair<int, int> > v)
{
    for (int mask=0; mask<(1<<4); mask++)
    {
        auto u = v;
        for (int i=0; i<4; i++)
            if ((mask>>i)&1)
                swap(u[i].fi, u[i].se);
        solve2(a, u);
    }
}

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

    vector<pair<int, int> > v(4);
    for (auto& [x, y] : v)
        cin>>x>>y;
    int s = 0;
    for (auto [x, y] : v)
        s += x*y;
    int a = sqrtl(s);
    if (a*a != s)
        cout<<0<<"\n", exit(0);

    sort(v.begin(), v.end());
    while (true)
    {
        solve(a, v);
        if (!next_permutation(v.begin(), v.end()))
            break;
    }
    cout<<0<<"\n";
}