#include<bits/stdc++.h>
#define x first
#define y second
#define eb emplace_back
#define pb push_back
#define FOR(i,a,b) for(int i=(a);i<=(b);++i)
#define ROF(i,a,b) for(int i=(a);i>=(b);--i)
#define all(x) (x).begin(),(x).end()
#define mp make_pair
#define sz(x) (int)(x).size()
#define make_unique(x) sort(all(x)), (x).erase(unique(all(x)), (x).end())

using namespace std;

typedef long long i64;
//typedef __int128 i128;
typedef long double ld;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<i64> vl;
typedef vector<vl> vvl;
typedef pair<int,int> pii;
typedef pair<i64,i64> pll;
typedef tuple<int,int,int> iii;
typedef vector<pii> vpii;
typedef vector<pll> vpll;

int readInt() { int a; scanf("%d",&a); return a; }
i64 readLong() { i64 a; scanf("%lld",&a); return a; }
char readChar() { char a; scanf(" %c",&a); return a; }
double readDouble() { double a; scanf(" %lf",&a); return a; }
void readString(char *s) { scanf(" %s",s); }

const int mod = 998244353;
int add(int a, int b) { return ((a+=b)>=mod) ? a-mod:a; }
int mul(int a, int b) { return a*1ll*b%mod; }
int pw(int a, int b) {
	int ans = 1, res = a;
	for(int i = 1; i <= b; i*=2, res=mul(res,res)) {
		if(i&b) {
			ans = mul(ans, res);
		}
	}
	return ans;
}

struct A{
	int x, y1, y2;
	int in;
	A(int x, int y1, int y2, int in): x(x), y1(y1), y2(y2), in(in) {

	}

	bool operator < (const A& o) const {
		if(x != o.x) return x < o.x;
		return in > o.in;
	}
};
int main() {
	int n = readInt();
	bool ans = false;
	vector<A> event;
	FOR(i,1,n) {
		int x1,y1,x2,y2;
		scanf("%d %d %d %d",&x1,&y1,&x2,&y2);
		event.eb(x1, y1, y2, 1);
		event.eb(x2, y1, y2, 0);
	}

	set<int> sweep;
	sort(all(event));
	for(int i = 0; i < sz(event); ) {
		int j;
		for(j = i; j < sz(event); ++j) {
			if(event[j].x != event[i].x) {
				break;
			}
			if(event[j].in) {
				if(sweep.count(event[j].y1) != 0) {
						//printf("wtf %d %d %d\n",event[j].x,event[j].y1,event[j].y2);
					return !printf("1\n");
				}
				if(sweep.count(event[j].y2) != 0) {
						//printf("wtf %d %d %d\n",event[j].x,event[j].y1,event[j].y2);
					return !printf("1\n");
				}
				set<int>::iterator it, it2;
				it = sweep.insert(event[j].y1).x;
				it2 = sweep.insert(event[j].y2).x;
				it++;
				if(it != it2) {
					//printf("wtf %d %d %d\n",event[j].x,event[j].y1,event[j].y2);
					return !printf("1\n");
				}
			} else {
				sweep.erase(event[j].y1);
				sweep.erase(event[j].y2);
			}
		}
		i = j;
	}
	printf("0\n");
	return 0;
}