n                  the number 'n' read from the file 'pin'
a1 b1
a2 b2
.....              the couples of positive integer numbers requested
ai bi
t                  the number of the couples found for a certain 'n'

1 xl1 yl1 xr1 yr1
2 xl2 yl2 xr2 yr2
.................
n xln yln xrn yrn

where:
1, 2, ..., n     represent the indeces of the rectangles
xli yli xri yri  represent the coordinates upper left corner,
lower right 
corner  of the rectangle i

i d1 d2 d3 ... dk

                 0 <= n <= 100
                 0 <= xli, yli, xri, yri <= 1000  (integers)
                 two rectangles intersect if:
                        - at least a side of each of them intersect;
                        - have at least a common vertex;
                        - have at least a common side;
                 in case a rectangle i does intersect none of the others, on
it's line will   
                 appear only i

1 1 6 10 1
2 2 9 4 5
3 8 11 13 6
4 13 4 15 2
5 5 9 17 3
6 4 16 5 14

1 2 3 5
2 1
3 1 4 5
4 5
5 1 3 4
6