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

void calc(int msk){
    if(msk == 15){
    	cout << "1\n";
    	exit(0);
    }
	for(int i = 0; i < sq; i++){
		for(int j = 0; j < 4; j++){
			if(msk >> j & 1){
				continue;
			}
			if(a[i] + w[j] <= sq && i + h[j] <= sq){
				int l = a[i], r = a[i] + w[j];
				bool bad = 0;
				for(int k = i; k < i + h[j]; k++){
					if(a[k] != l){
						bad = 1;
						break;
					}
				}
				            
				if(!bad){
					for(int k = i; k < i + h[j]; k++){
						a[k] = r;
					}
					calc(msk | (1 << j));
                	
                	for(int k = i; k < i + h[j]; k++){
						a[k] = l;
					}
				}
			}
			
			if(a[i] + h[j] <= sq && i + w[j] <= sq){
				int l = a[i], r = a[i] + h[j];
				bool bad = 0;
				for(int k = i; k < i + w[j]; k++){
					if(a[k] != l){
						bad = 1;
						break;
					}
				}               
				if(!bad){
					for(int k = i; k < i + w[j]; k++){
						a[k] = r;
					}
					calc(msk | (1 << j));
                	for(int k = i; k < i + w[j]; k++){
						a[k] = l;
					}
				}
			}
		}
	}	
}
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);	
	
	cout << "0\n";
}