#include <bits/stdc++.h>

using namespace std;

const int N = 400040;

struct Query
{
    int x, t, y1, y2;
    bool operator <(const Query &rhs) const
    {
        return x < rhs.x;
    }
};

int X1[N], Y1[N], X2[N], Y2[N];
vector<int> v;
vector<Query> op;

int m, ft[N];

int lowbit(int x)
{
    return x & -x;
}

int query(int p)
{
    int res = 0;

    while(p)
    {
        res += ft[p];
        p -= lowbit(p);
    }

    return res;
}

void update(int p, int v)
{
    while(p <= m)
    {
        ft[p] += v;
        p += lowbit(p);
    }
}

int main()
{
    int n;
    int i;

    scanf("%d", &n);
    for(i = 0; i < n; i ++)
        scanf("%d%d%d%d", &X1[i], &Y1[i], &X2[i], &Y2[i]);

    for(i = 0; i < n; i ++)
    {
        v.push_back(X1[i]);
        v.push_back(Y1[i]);
        v.push_back(X2[i]);
        v.push_back(Y2[i]);
    }
    sort(v.begin(), v.end());
    v.erase(unique(v.begin(), v.end()), v.end());
    for(i = 0, m = v.size(); i < n; i ++)
    {
        X1[i] = lower_bound(v.begin(), v.end(), X1[i]) - v.begin() + 1;
        Y1[i] = lower_bound(v.begin(), v.end(), Y1[i]) - v.begin() + 1;
        X2[i] = lower_bound(v.begin(), v.end(), X2[i]) - v.begin() + 1;
        Y2[i] = lower_bound(v.begin(), v.end(), Y2[i]) - v.begin() + 1;
    }

    for(i = 0; i < n; i ++)
    {
        op.push_back({X1[i], 1, Y1[i], Y2[i]});
        op.push_back({X2[i], -1, Y1[i], Y2[i]});
    }
    sort(op.begin(), op.end());

    for(auto it : op)
    {
        if(it.t == -1)
        {
            update(it.y1, -1);
            update(it.y2, -1);
        }
        if(query(it.y2 - 1) - query(it.y1))
        {
            puts("1");
            return 0;
        }
        if(it.t == 1)
        {
            update(it.y1, 1);
            update(it.y2, 1);
        }
    }

    puts("0");

    return 0;
}