1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
// Artur Minorczyk

#include <cstdio>
#include <iostream>
#include <algorithm>
#include <string>
#include <sstream>
#include <vector>
#include <list>
#include <set>
#include <map>
using namespace std;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef pair<int, int> PI;
typedef vector<PI> VPI;
typedef long long LL;
typedef vector<LL> VLL;
#define FOR(x, b, e) for(int x = b; x <= (e); ++x)
#define FORD(x, b, e) for(int x = b; x >= (e); --x)
#define REP(x, n) for(int x = 0; x < (n); ++x)
#define VAR(v, n) __typeof(n) v = (n)
#define FOREACH(i, c) for(VAR(i, (c).begin()); i != (c).end(); ++i)
#define ALL(c) (c).begin(), (c).end()
#define SIZE(x) ((int)(x).size())
#define PB push_back
#define MP make_pair
#define ST first
#define ND second
const int INF = 1000000001;
const double EPS = 10e-9;

struct Point
{
	int x, y;
};
struct Rect
{
	int id;
	Point l, r;
};
bool Compare(Rect a, Rect b)
{
	if(a.l.x == b.l.x)
	{
		if(a.r.x == b.r.x)
		{
			if(a.l.y == b.l.y) return a.r.y < b.r.y;
			else return a.l.y < b.l.y;
		}
		else return a.l.x < b.l.x;
	}
	else return a.l.x < b.l.x;
}
bool Intersect(Rect a, Rect b)
{
	return a.l.x < b.r.x && a.r.x > b.l.x && a.l.y < b.r.y && a.r.y > b.l.y;
}
void AddRect(Rect a, list<Rect> &l)
{
	Rect b;
	FOREACH(it, l) if(Intersect(a, *it))
	{
		b.l.x = min(a.l.x, it->l.x);
		b.l.y = min(a.l.y, it->l.y);
		b.r.x = max(a.r.x, it->r.x);
		b.r.y = max(a.r.y, it->r.y);
		l.erase(it);
		AddRect(b, l);
		return;
	}
	l.PB(a);
}
int main()
{
	int n;
	Rect r;
	scanf("%d", &n);
	list<Rect> tribes;
	REP(x, n)
	{
		scanf("%d%d%d%d", &r.l.x, &r.r.x, &r.l.y, &r.r.y);
		AddRect(r, tribes);
	}
	printf("%d\n", SIZE(tribes));
	tribes.sort(Compare);
	FOREACH(it, tribes) printf("%d %d %d %d\n", it->l.x, it->r.x, it->l.y, it->r.y);
	return 0;
}