#include<bits/stdc++.h>
using namespace std;
using ll=long long;
template<typename T>
ostream& operator << (ostream &out,const vector<T>&x){
	if(x.empty())return out<<"[]";
	out<<'['<<x[0];
	for(int len=x.size(),i=1;i<len;i++)out<<','<<x[i];
	return out<<']';
}
template<typename T>
vector<T> ary(const T *a,int l,int r){
	return vector<T>{a+l,a+1+r};
}
template<typename T>
void debug(T x){
	cerr<<x<<'\n';
}
template<typename T,typename ...S>
void debug(T x,S ...y){
	cerr<<x<<' ',debug(y...);
}
struct matrix{
	int x,y;
};
using vx=vector<matrix>;
void dfs(vx A){
	if(A.size()==1){
		if(A[0].x==A[0].y){
			puts("1"),exit(0);
		}
		return;
	}
	int len=A.size();
	for(int i=0;i<len;i++){
		for(int j=0;j<len;j++){
			if(i==j)continue;
			for(int ta=0;ta<2;ta++){
				for(int o=0;o<2;o++){
					vx B=A,C;
					for(int x=0;x<len;x++)if(x!=i&&x!=j)C.push_back(A[x]);
					if(ta)swap(B[i].x,B[i].y);
					if(o==0){
						if(B[i].x!=B[j].x)continue;
						C.push_back({B[i].x,B[i].y+B[j].y});
						dfs(C);
					}else{
						if(B[i].y!=B[j].y)continue;
						C.push_back({B[i].x+B[j].x,B[i].y});
						dfs(C);
					}
				}
			}
		}
	}
}
int main(){
	vx A;
	for(int i=0,x,y;i<4;i++){
		cin>>x>>y;
		A.push_back({x,y});
	}
	dfs(A);
	puts("0");
	return 0;
}