#include <bits/stdc++.h>
#define fi first
#define se second
#define ll long long
#define pl pair<ll, ll>
#define pi pair<int, int>
#define minpq priority_queue<ll, vector<ll>, greater<ll>>
using namespace std;

#if 1
void __print(int x) {cerr << x;}
void __print(long x) {cerr << x;}
void __print(long long x) {cerr << x;}
void __print(unsigned x) {cerr << x;}
void __print(unsigned long x) {cerr << x;}
void __print(unsigned long long x) {cerr << x;}
void __print(float x) {cerr << x;}
void __print(double x) {cerr << x;}
void __print(long double x) {cerr << x;}
void __print(char x) {cerr << '\'' << x << '\'';}
void __print(const char *x) {cerr << '\"' << x << '\"';}
void __print(const string &x) {cerr << '\"' << x << '\"';}
void __print(bool x) {cerr << (x ? "true" : "false");}
template<typename T, typename V>
void __print(const pair<T, V> &x) {cerr << '{'; __print(x.first); cerr << ','; __print(x.second); cerr << '}';}
template<typename T>
void __print(const T &x) {int f = 0; cerr << '['; for (auto &i: x) cerr << (f++ ? "," : ""), __print(i); cerr << "]";}
void _print() {cerr << endl << flush;}
template <typename T, typename... V>
void _print(T t, V... v) {__print(t); if (sizeof...(v)) cerr << ", "; _print(v...);}
#define debug(x...) cerr << "*["<<__LINE__<<"]\t"<< #x << " = "; _print(x)
#endif

const ll mod = 1e9 + 7;

template<typename T> bool chkmin(T &a, T b){return (b < a) ? a = b, 1 : 0;}
template<typename T> bool chkmax(T &a, T b){return (b > a) ? a = b, 1 : 0;}
ll gcd(ll a, ll b) {if(b == 0){return a;} return gcd(b, a % b);}

int main(){
	ios::sync_with_stdio(false);
	cin.tie(0);
	int w[4], h[4];
	for (int i = 0; i < 4; i ++) cin >> w[i] >> h[i];
	int area = 0;
	for (int i = 0; i < 4; i ++) area += h[i] * w[i];
	int len = sqrt(area);
	for (int i = len - 1; i <= len + 1; i ++){
		if (i * i == area) len = i;
	}
	if (len * len != area){
		cout << 0 << '\n';
		return 0;
	}
	vector<int> perm(4); for (int i = 0; i < 4; i ++) perm[i] = i;
	do{
		for (int mask = 0; mask < (1 << 4); mask ++){
			int nh[4], nw[4];
			for (int i = 0; i < 4; i ++){
				nh[i] = (mask & (1 << i) ? w[perm[i]] : h[perm[i]]);
				nw[i] = (mask & (1 << i) ? h[perm[i]] : w[perm[i]]);
			}
			if (nh[0] == nh[1] && nh[2] == nh[3] && nh[0] + nh[2] == len && nw[0] + nw[1] == len && nw[2] + nw[3] == len){
				cout << 1 << '\n';
				return 0;
			}
			int remh = len, remw = len;
			for (int i = 0; i < 4; i ++){
				if (nh[i] == remh) remw -= nw[i];
				else if (nw[i] == remw) remh -= nh[i];
			}
			if (remh == 0 || remw == 0){
				cout << 1 << '\n';
				return 0;
			}
		}
	} while(next_permutation(perm.begin(), perm.end()));
	cout << 0 << '\n';
}

/*
Do something instead of nothing!
Print out stuffs / study samples when you cannot find the bug!
*/