#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);

	for (auto& [x, y] : a) {
		if (max(x, y) > dim) answer(false);
	}

	vector dp(1<<4, vector(dim+1, vector<bool>(dim+1)));
	for (int i=0; i<4; i++) {
		dp[1<<i][a[i].first][a[i].second] = true;
		dp[1<<i][a[i].second][a[i].first] = true;
	}

	for (int i=0; i<dim+1; i++) {
		for (int j=0; j<dim+1; j++) {
			for (int k=0; k<(1<<4); k++) {
				if (!dp[k][i][j]) continue;

				for (int l=0; l<=i && i+l<=dim; l++) {
					for (int k2=0; k2<(1<<4); k2++) {
						if ((k & k2) & k) continue;
						if (dp[k2][l][j]) dp[k | k2][i+l][j] = true;
					}			
				}

				for (int l=0; l<=j && j+l<=dim; l++) {
					for (int k2=0; k2<(1<<4); k2++) {
						if ((k & k2) & k) continue;
						if (dp[k2][i][l]) dp[k | k2][i][j+l] = true;
					}			
				} 
			}
		}
	}

	cout << dp[(1<<4)-1][dim][dim] << '\n';
}
 
int main() {
	cin.tie(0)->sync_with_stdio(false);
	cout << setprecision(16);
	solve();
}