#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
 
using namespace std;
using namespace __gnu_pbds;
typedef long long int lld;
typedef tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update> ordered_set;
#define rep(i,a,b) for(int i=a;i<b;i++)
#define trav(a,v) for(auto a:v)

void solve(){
	int n;
	cin>>n;
	vector<tuple<lld,lld,lld,lld> >V;
	rep(i,0,n){
		lld x1,y1,x2,y2;
		cin>>x1>>y1>>x2>>y2;
		V.push_back({x1,-1,y1,y2});
		V.push_back({x2,1,y1,y2});
	}
	sort(V.begin(),V.end());
	multiset<lld> M;
	for(auto [a,b,c,d]:V){
		if(b==-1){
			auto it=M.lower_bound(c);
			if(it!=M.end() && *it<=d){
				cout<<"1\n";
				return;
			}
			M.insert(c);
			M.insert(d);
		}else{
			M.erase(M.find(c));
			M.erase(M.find(d));
			auto it=M.lower_bound(c);
			if(it!=M.end() && *it<=d){
				cout<<"1\n";
				return;
			}
			
		}
	}
	cout<<"0\n";
}

int main(){
	ios::sync_with_stdio(0);
	cin.tie(0);
	int tt=1;
	//cin>>tt;
	while(tt--){
		solve();
	}
}