#include <bits/stdc++.h>
using namespace std;

#define tsolve int t; cin >> t; while(t--) solve
#define debug(x) cerr << __LINE__ << ": "#x" = " << (x) << endl
#define nl '\n'
#define all(x) ::begin(x), ::end(x)
#define sz(x) (int)::size(x)
using ll = long long;
using ld = long double;

ll _sqrt(ll x) {
	ll ans = max(0.0L, sqrtl(x) - 5);
	while (ans * ans < x) ans++;
	return ans;
}

void answer(bool ans) {
	cout << ans << '\n';
	exit(0);
}

void solve() {
    vector<pair<int, int>> a(4);
	int sm = 0;
	for (auto& [x, y] : a) cin >> x >> y, sm += x * y;

	int dim = _sqrt(sm);
	if (dim * dim != sm) answer(false);

	int idk = dim;
	for (auto& [x, y] : a) {
		if (x > y) swap(x, y);

		if (y > dim) answer(false);
		if (y == dim) idk -= x, x = 0, y = 0;
	}

	sort(all(a));
	do {
		vector<pair<int, int>> ta(4);
		for (int mask=0; mask<(1<<4); mask++) {
			for (int i=0; i<4; i++) {
				ta[i] = a[i];
				if (mask & (1<<i)) swap(ta[i].first, ta[i].second);
			}

			vector<vector<bool>> b(dim, vector<bool>(idk));
			int cur = 0;
			auto f = [&](int i, int j, int i2, int j2) {
				//debug(i), debug(j), debug(i2), debug(j2);
				for (int x=i; x<i2; x++) for (int y=j; y<j2; y++) {
					cur += 1 - b[x][y];
					b[x][y] = true;
				}
			};
			f(0, 0, ta[0].first, ta[0].second);
			f(0, idk - ta[1].second, ta[1].first, idk);
			f(dim - ta[2].first, 0, dim, ta[2].second);
			f(dim - ta[3].first, idk - ta[3].second, dim, idk);
			//debug(cur);
			if (cur == dim * idk) answer(true);
		}
	} while (next_permutation(all(a)));
	answer(false);
}
 
int main() {
	cin.tie(0)->sync_with_stdio(false);
	cout << setprecision(16);
	solve();
}