#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;

const int MAXN = 5000;

struct interv {
    int x1, x2, y1, y2;
};

struct point {
    int st, dr;
};

interv I[MAXN];

node aint[2 * MAXN];

int main()
{
    int N;
    cin >> N;
    for(int i = 0; i < N; ++i) {
        cin >> I[i].x1 >> I[i].y1 >> I[i].x2 >> I[i].y2;
        Update(0, N, I[i].y1, I[i].y2);       
    }
    
    return 0;
}