#include "bits/stdc++.h"
#define rep(i, a, n) for (auto i = a; i <= (n); ++i)
#define revrep(i, a, n) for (auto i = n; i >= (a); --i)
#define all(a) a.begin(), a.end()
#define sz(a) (int)(a).size()

using namespace std;
using ll = long long;
using pii = pair<int, int>;
using vi = vector<int>;
using vvi = vector<vi>;

template<class A> string to_string(A v) {
	bool first = 1;
	string res = "{";
	for (const auto &x: v) {
		if (!first) res += ", ";
		first = 0;
		res += to_string(x);
	}
	res += "}";
	return res;
}

void debug_out() { cerr << endl; }
template<class Head, class... Tail> void debug_out(Head H, Tail... T) {
	cerr << " " << to_string(H);
	debug_out(T...);
}
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)

int main() {
	ios::sync_with_stdio(0); cin.tie(0);

	int n; cin >> n;
	using node = tuple<int, int, int, int>;
	vector<node> ops;
	
	rep(i, 0, n - 1) {
		int x1, y1, x2, y2;
		cin >> x1 >> y1 >> x2 >> y2;
		ops.emplace_back(x1, y1, y2, 1);
		ops.emplace_back(x2, y1, y2, -1);
	}
	sort(all(ops));
	reverse(all(ops));
	set<int> S;
	int ok = 0;
	while (sz(ops)) {
		// debug(S);
		int nowx = get<0>(ops.back());
		vector<node> tmp;
		while (sz(ops) && get<0>(ops.back()) == nowx) {
			tmp.push_back(ops.back());
			ops.pop_back();
		}
		sort(all(tmp), [](node a, node b) { return get<1>(a) < get<1>(b); });
		int tot = sz(tmp);
		rep(i, 0, tot - 2) {
			if (get<2>(tmp[i]) >= get<1>(tmp[i + 1])) ok = 1;
		}
		for (auto [x, y1, y2, op]: tmp) {
			auto it = S.upper_bound(y1);
			if (it != S.end() && *it < y2) ok = 1;
		}
		for (auto [x, y1, y2, op]: tmp) if (op == 1) {
			S.emplace(y1);
			S.emplace(y2);
		}
		for (auto [x, y1, y2, op]: tmp) if (op == -1) {
			S.erase(y1);
			S.erase(y2);
		}
	}
	printf("%d\n", ok);
	return 0;
}