#include <bits/stdc++.h>

#define f first
#define s second
#define sz(s) (int)s.size()
#define int long long

using namespace std;

const int N = (int)5e5 + 100;
const int M = N + 7;
const int MOD = 998244353;
const int INF = (int)1e18 + 100;


int n, w[4], h[4], a[N], sq, dep;

void calc(vector<pair<int, int> > v, int msk){
	sort(v.begin(), v.end());
	v.resize(unique(v.begin(), v.end()) - v.begin());
	
	if(v.empty()){
		cout << "1\n";
		exit(0);
	}
	

    for(auto i = 0; i < sz(v); i++){
		for(int j = 0; j < 4; j++){
			if(msk >> j & 1)
				continue;
			int x = v[i].f, y = v[i].s;
			if(x + h[j] <= sq && y + w[j] <= sq){
				vector<pair<int, int> > nxt;
				for(auto [xx, yy] : v){
					if(x <= xx && xx <= x + h[j] && y <= yy && yy <= y + w[j]) continue;
					nxt.push_back({xx, yy});
				}
				
				if(x + h[j] < sq){
					nxt.push_back({x + h[j], y});
				}	
				if(y + w[j] < sq){
					nxt.push_back({x, y + w[j]});
				}
				if(x + h[j] < sq && y + w[j] < sq){
					nxt.push_back({x + h[j], y + w[j]});
				}
				calc(nxt, msk | (1 << j));
			}

			if(x + w[j] <= sq && y + h[j] <= sq){
				vector<pair<int, int> > nxt;
				for(auto [xx, yy] : v){
					if(x <= xx && xx <= x + h[j] && y <= yy && yy <= y + w[j]) continue;
					nxt.push_back({xx, yy});
				}
				
				if(x + w[j] < sq){
					nxt.push_back({x + w[j], y});
				}	
				if(y + h[j] < sq){
					nxt.push_back({x, y + h[j]});
				}
				if(x + w[j] < sq && y + h[j] < sq){
					nxt.push_back({x + w[j], y + h[j]});
				}
				calc(nxt, msk | (1 << j));
			} 
		}
	}

}
main() {
	ios_base::sync_with_stdio(0);
	cin.tie(0); cout.tie(0);
	n = 4;
	int s = 0;
	for(int i = 0; i < 4; i++){
		cin >> w[i] >> h[i];    
		s += w[i] * h[i];
	}                     
	sq = 1;
	while((sq + 1) * (sq + 1) <= s)
		sq++;
	
	if(sq * sq != s){
		cout << "0\n";
		return 0;
	}
	            
    calc({{0, 0}}, 0);	
	
	cout << "0\n";
}