// Too many mind, no mind.
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <cmath>
#include <vector>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <queue>
#include <ctime>
#include <cassert>
#include <complex>
#include <string>
#include <cstring>
#include <chrono>
#include <random>
#include <bitset>
#include <array>
#include <iomanip>

using namespace std;

#define mp make_pair
#define fi first
#define se second
#define pb push_back
#define ALL(x) (x).begin(), (x).end()
#define RALL(x) (x).rbegin(), (x).rend()
#define COMP(x) sort(ALL(x)); x.resize(unique(ALL(x)) - (x).begin())
#define forn(i, n) for (int i = 0; i < (int)(n); ++i)
#define fore(i, a, b) for (int i = (int)(a); i <= (int)(b); ++i)
#define ford(i, n) for (int i = (int)(n) - 1; i >= 0; --i)

using pii = pair <int, int>;
using vi = vector <int>;
using vpi = vector <pii>;
using ll = long long;
using pll = pair<ll, ll>;
using vl = vector<ll>;
using ld = long double;
using vld = vector<ld>;
using vpl = vector<pll>;


bool solve(vpl a, int n, int m) {
	if (a.empty()) return m==0;
	bool ok = 0;
	int k = a.size();
	if (k >= 1) {
		forn(i, k) {
			if (a[i].fi==n) {
				vpl b = a;
				b.erase(b.begin()+i);
				ok |= solve(b, n, m-a[i].se);
			}
		}
	} 
	if (k >= 2) {
		forn(i, k) fore(j, i+1, k-1) {
			if (a[i].fi + a[j].fi != n) continue;
			if (a[i].se == a[j].se) {
				vpl b = a;
				b.erase(b.begin()+i);
				b.erase(b.begin()+j-1);
				ok |= solve(b, n, m-a[i].se);
			} else {
				int in=0;
				forn(l, k) if (l!=i && l!=j) {
					if (a[l].se == m-a[i].se && a[l].fi == a[i].fi) in++;
					if (a[l].se == m-a[j].se && a[l].fi == a[j].fi) in++;
				}
				ok |= in==2;
			}
		}
	}
	if (k>=3) {
		forn(i, k) if (a[i].fi == n) {
			bool cur=1;
			int h = 0;
			forn(j, k) if (j != i) {
				h += a[j].fi;
				cur &= a[j].se == m - a[i].se;
			}
			cur &= h == n;
			ok |= cur;
		}
	}
	if (k>=4) {
		int h = 0;
		bool cur = 1;
		forn(i, k) {
			h += a[i].fi;
			cur &= a[i].se == m;
		}
		cur &= h == n;
		ok |= cur;
	}
	return ok;
}
ll root(ll n) {
	ll lo = 0, hi = n;
	while (lo < hi) {
		ll mid = lo + (hi-lo)/2;
		if (mid*mid >= n) hi=mid;
		else lo = mid+1;
	}
	return lo;
}
int main() {
	ios_base::sync_with_stdio(0), cin.tie(0);
	//freopen("input.txt", "r", stdin);
	//freopen("output.txt", "w", stdout);
	ll total = 0;
	vpl a(4);
	forn(i, 4) {
		ll h, w; cin >> h >> w;
		a[i] = mp(h, w);
		total += h*w;
	}
	sort(ALL(a));
	int n = root(total);
	if (n*n != total) {
		cout << 0 << endl;
		return 0;
	}
	bool ok = 0;
	vi p = {0, 1, 2, 3};
	do {
		forn(mask, 16) {
			vpl b;
			forn(i, 4) b.pb(a[p[i]]);
			forn(i, 4) if (mask>>i&1) swap(b[i].fi, b[i].se);
			ok = solve(b, n, n);
		}
	} while (next_permutation(ALL(p)));
	cout << ok << endl;
	return 0;
}