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
 90
 91
 92
 93
 94
 95
 96
 97
 98
 99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
import java.io.BufferedOutputStream;
import java.io.DataInputStream;
import java.io.InputStream;
import java.util.ArrayList;
import java.util.Collections;
import java.util.List;

public class ple {

	private static Parser input = new Parser(System.in);
	private static BufferedOutputStream output = new BufferedOutputStream(
			System.out);

	public static void main(String[] args) throws Exception {

		int n = input.nextInt();
		List<Tribe> list = new ArrayList<>();

		for (int i = 0; i < n; i++) {
			int a = input.nextInt();
			int b = input.nextInt();
			int c = input.nextInt();
			int d = input.nextInt();

			Tribe tribe = new Tribe(a, b, c, d);
			boolean go = true;
			while (go) {
				int inter = -1;
				go = false;
				for (int j = 0; j < list.size(); j++) {
					if (intersect(tribe, list.get(j))) {
						inter = j;
						break;
					}
				}
				if(inter != -1){
					tribe = loveEachOther(tribe, list.get(inter));
					list.remove(inter);
					go = true;
				}
			}
			list.add(tribe);
		}
		
		Collections.sort(list);
		
		output.write((list.size() + "\n").getBytes());
		for(Tribe t : list){
			output.write((t.x1 + " " + t.x2 + " " + t.y1 + " " + t.y2 + "\n").getBytes());
		}

		output.flush();
	}

	private static boolean intersect(Tribe a, Tribe b) {
		boolean xIntersection = false;
		boolean yIntersection = false;

		if ((a.x1 <= b.x1 && a.x2 > b.x1) || (b.x1 <= a.x1 && b.x2 > a.x1))
			xIntersection = true;

		if ((a.y1 <= b.y1 && a.y2 > b.y1) || (b.y1 <= a.y1 && b.y2 > a.y1))
			yIntersection = true;

		return xIntersection && yIntersection;
	}

	private static Tribe loveEachOther(Tribe a, Tribe b) {
		int x1 = Math.min(a.x1, b.x1);
		int x2 = Math.max(a.x2, b.x2);
		int y1 = Math.min(a.y1, b.y1);
		int y2 = Math.max(a.y2, b.y2);

		return new Tribe(x1, x2, y1, y2);
	}

}

class Tribe implements Comparable<Tribe> {
	int x1;
	int x2;
	int y1;
	int y2;

	public Tribe(int x1, int x2, int y1, int y2) {
		this.x1 = x1;
		this.x2 = x2;
		this.y1 = y1;
		this.y2 = y2;
	}

	@Override
	public int compareTo(Tribe o) {
		if (o.x1 == x1) {
			if (o.x2 == x2) {
				if (o.y1 == y1) {
					return Integer.compare(y2, o.y2);
				}
				return Integer.compare(y1, o.y1);
			}
			return Integer.compare(x2, o.x2);
		}
		return Integer.compare(x1, o.x1);
	}

}

class Parser {
	final private int BUFFER_SIZE = 1 << 16;

	private DataInputStream din;
	private byte[] buffer;
	private int bufferPointer, bytesRead;

	public Parser(InputStream in) {
		din = new DataInputStream(in);
		buffer = new byte[BUFFER_SIZE];
		bufferPointer = bytesRead = 0;
	}

	public int nextInt() throws Exception {
		int ret = 0;
		byte c = read();
		while (c <= ' ')
			c = read();
		boolean neg = c == '-';
		if (neg)
			c = read();
		do {
			ret = ret * 10 + c - '0';
			c = read();
		} while (c > ' ');
		if (neg)
			return -ret;
		return ret;
	}

	private void fillBuffer() throws Exception {
		bytesRead = din.read(buffer, bufferPointer = 0, BUFFER_SIZE);
		if (bytesRead == -1)
			buffer[0] = -1;
	}

	private byte read() throws Exception {
		if (bufferPointer == bytesRead)
			fillBuffer();
		return buffer[bufferPointer++];
	}
}