#include <bits/stdc++.h>
#define ff first
#define ss second
using namespace std;

typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;

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

	pii V[4];
	for (int i = 0; i < 4; i++) {
		cin >> V[i].ff >> V[i].ss;
	}
	sort(V, V + 4);

	for (int msk = 0; msk < 16; msk++) {
		do {
			int a[4], b[4];
			for (int i = 0; i < 4; i++) {
				tie(a[i], b[i]) = V[i];

				if (msk >> i & 1) {
					swap(a[i], b[i]);
				}	
			}

			if (a[0] == a[1] && a[2] == a[3] && b[0] + b[1] == b[2] + b[3]) {
				return !(cout << 1 << '\n');
			}
			if (a[1] == a[2] && a[2] == a[3] && b[0] == b[1] + b[2] + b[3]) {
				return !(cout << 1 << '\n');
			}
			if (a[0] + a[1] == a[2] && a[2] == a[3] && b[0] == b[1]) {
				return !(cout << 1 << '\n');
			}
			if (a[0] + a[1] == a[2] && b[0] == b[1] && b[0] + b[2] == b[3]) {
				return !(cout << 1 << '\n');
			}
			if (a[0] == a[1] && a[1] == a[2] && a[2] == a[3]) {
				return !(cout << 1 << '\n');
			}
		} while (next_permutation(V, V + 4));
	}

	cout << 0 << '\n';
}