Problem: Pasha is a young technician, nevertheless, he has already got a huge goal: to assemble a PC. The first task he has to become familiar with is to assemble an electric scheme.

The scheme Pasha assembled yesterday consists of several wires. Each wire is a segment that connects two points on a plane with integer coordinates within the segment [1, 10^9].

There are wires of two colors in the scheme: 

  * red wires: these wires are horizontal segments, i.e. if such a wire connects two points (x_1, y_1) and (x_2, y_2), then y_1 = y_2; 
  * blue wires: these wires are vertical segments, i.e. if such a wire connects two points (x_1, y_1) and (x_2, y_2), then x_1 = x_2. 



Note that if a wire connects a point to itself, it may be blue, and it can be red. Also, in Pasha's scheme no two wires of the same color intersect, i.e. there are no two wires of same color that have common points.

The imperfection of Pasha's scheme was that the wires were not isolated, so in the points where two wires of different colors intersect, Pasha saw sparks. Pasha wrote down all the points where he saw sparks and obtained a set of n distinct points. After that he disassembled the scheme.

Next morning Pasha looked at the set of n points where he had seen sparks and wondered how many wires had he used. Unfortunately, he does not remember that, so he wonders now what is the smallest number of wires he might have used in the scheme. Help him to determine this number and place the wires in such a way that in the resulting scheme the sparks occur in the same places.

Input

The first line contains a single integer n (1 ≤ n ≤ 1000) — the number of points where Pasha saw sparks.

Each of the next n lines contain two integers x and y (1 ≤ x, y ≤ 10^9) — the coordinates of a point with sparks. It is guaranteed that all points are distinct.

Output

Print the description of the scheme in the following format.

In the first line print h — the number of horizontal red wires (0 ≤ h). In each of the next h lines print 4 integers x_1, y_1, x_2, y_2 — the coordinates of two points (x_1, y_1) and (x_2, y_2) that are connected with this red wire. The segmenst must be horizontal, i.e. y_1 = y_2 must hold. Also, the constraint 1 ≤ x_1, y_1, x_2, y_2 ≤ 10^9 must hold.

After that print v — the number of vertical blue wires (0 ≤ v). In each of the next v lines print 4 integers x_1, y_1, x_2, y_2 — the coordinates of two points (x_1, y_1) and (x_2, y_2) that are connected with this blue wire. The segmenst must be vertical, i.e. x_1 = x_2 shomustuld hold. Also, the constraint 1 ≤ x_1, y_1, x_2, y_2 ≤ 10^9 must hold.

No two segments of the same color should have common points. The set of points where sparks appear should be the same as given in the input.

The number of segments (h + v) should be minimum possible. It's easy to see that the answer always exists. If there are multiple possible answers, print any.

Examples

Input

4
2 2
2 4
4 2
4 4


Output

2
5 2 1 2
1 4 5 4
2
2 1 2 5
4 5 4 1


Input

4
2 1
3 2
2 3
1 2


Output

4
2 1 2 1
3 2 3 2
1 2 1 2
2 3 2 3
3
1 2 1 2
3 2 3 2
2 3 2 1

Note

In the first example Pasha could have assembled the following scheme:

<image>

In this scheme there are 2 wires of each color: red ones connecting (5, 2) with (1, 2) and (1, 4) with (5, 4), blue ones connecting (2, 1) with (2, 5) and (4, 5) with (4, 1). Note that the sparks appear in the points that are described in the input, they are shown in yellow on the picture. For example, Pasha will see the spark in the point (2, 4) because the second red wire and the first blue wire intersect there. It is possible to show that we can't have less than 4 wires to produce a scheme with same sparks positions.

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
vector<vector<int> > adj(2001);
int match[2001 + 1], dis[2001 + 1];
bool visited[2001 + 1], minimumVertexCover[2001], maximumIndependentSet[2001];
const int inf = 1E9;
void ResetVisited() {
  for (int i = 0; i <= 2001; ++i) {
    visited[i] = 0;
  }
}
bool BFS(vector<int> &U) {
  queue<int> Q;
  for (auto u : U) {
    if (match[u] == 2001) {
      dis[u] = 0;
      Q.push(u);
    } else {
      dis[u] = inf;
    }
  }
  dis[2001] = inf;
  while (!Q.empty()) {
    int u = Q.front();
    Q.pop();
    visited[u] = 1;
    if (dis[u] < dis[2001]) {
      for (auto v : adj[u]) {
        if (dis[match[v]] == inf) {
          visited[v] = 1;
          dis[match[v]] = 1 + dis[u];
          Q.push(match[v]);
        }
      }
    }
  }
  return (dis[2001] != inf);
}
bool DFS(int u) {
  if (u == 2001) {
    return true;
  }
  for (auto v : adj[u]) {
    if (dis[match[v]] == 1 + dis[u]) {
      if (DFS(match[v])) {
        match[v] = u;
        match[u] = v;
        return true;
      }
    }
  }
  dis[u] = inf;
  return false;
}
int HopcroftKarpMaximumMatching(vector<int> &U, vector<int> &V) {
  for (auto u : U) {
    match[u] = 2001;
  }
  for (auto v : V) {
    match[v] = 2001;
  }
  int matching = 0;
  for (ResetVisited(); BFS(U); ResetVisited()) {
    for (auto u : U) {
      if (match[u] == 2001) {
        matching += DFS(u);
      }
    }
  }
  return matching;
}
void FillMinimumVertexCover(vector<int> &U, vector<int> &V) {
  for (auto u : U) {
    minimumVertexCover[u] = (match[u] != 2001 && visited[u] == 0);
  }
  for (auto v : V) {
    minimumVertexCover[v] = (match[v] != 2001 && visited[v] == 1);
  }
}
void FillMaximumIndependentSet(vector<int> &U, vector<int> &V) {
  for (auto u : U) {
    maximumIndependentSet[u] = (match[u] == 2001 || visited[u] == 1);
  }
  for (auto v : V) {
    maximumIndependentSet[v] = (match[v] == 2001 || visited[v] == 0);
  }
}
vector<tuple<int, int, int> > segments;
vector<int> AddSegments(vector<pair<int, int> > v) {
  vector<int> V;
  sort(v.begin(), v.end());
  for (int i = 0; i < v.size() - 1; ++i) {
    if (v[i + 1].first == v[i].first) {
      V.push_back(segments.size());
      segments.push_back(make_tuple(v[i].first, v[i].second, v[i + 1].second));
    }
  }
  return V;
}
bool DoSegmentsIntersect(int i, int j) {
  int x, y1, y2, y, x1, x2;
  tie(x, y1, y2) = segments[i];
  tie(y, x1, x2) = segments[j];
  return (x1 < x && x < x2 && y1 < y && y < y2);
}
vector<tuple<int, int, int, int> > MakeAnswerSegments(
    vector<int> &V, vector<pair<int, int> > &P, bool isHorizontal) {
  vector<tuple<int, int, int> > v;
  for (auto i : V) {
    if (maximumIndependentSet[i]) {
      v.push_back(segments[i]);
    }
  }
  for (auto p : P) {
    v.push_back(make_tuple(p.first, p.second, p.second));
  }
  sort(v.begin(), v.end());
  vector<tuple<int, int, int, int> > ans;
  for (int i = 0, j; i < v.size(); i = j) {
    int x, y1, y2;
    tie(x, y1, y2) = v[i];
    for (j = i + 1; j < v.size(); ++j) {
      int nx, ny1, ny2;
      tie(nx, ny1, ny2) = v[j];
      if (nx == x && ny1 == y2) {
        y2 = ny2;
      } else {
        break;
      }
    }
    if (isHorizontal) {
      ans.push_back(make_tuple(y1, x, y2, x));
    } else {
      ans.push_back(make_tuple(x, y1, x, y2));
    }
  }
  return ans;
}
void PrintAnswerSegments(vector<tuple<int, int, int, int> > &ans) {
  printf("%lu\n", ans.size());
  for (auto t : ans) {
    int x1, y1, x2, y2;
    tie(x1, y1, x2, y2) = t;
    printf("%d %d %d %d\n", x1, y1, x2, y2);
  }
}
int main() {
  int n;
  vector<pair<int, int> > xyPoints, yxPoints;
  cin >> n;
  while (n--) {
    int x, y;
    cin >> x >> y;
    xyPoints.push_back(make_pair(x, y));
    yxPoints.push_back(make_pair(y, x));
  }
  vector<int> U = AddSegments(xyPoints);
  vector<int> V = AddSegments(yxPoints);
  for (auto u : U) {
    for (auto v : V) {
      if (DoSegmentsIntersect(u, v)) {
        adj[u].push_back(v);
      }
    }
  }
  HopcroftKarpMaximumMatching(U, V);
  FillMaximumIndependentSet(U, V);
  vector<tuple<int, int, int, int> > horizontalSegments =
      MakeAnswerSegments(V, yxPoints, 1);
  vector<tuple<int, int, int, int> > verticalSegments =
      MakeAnswerSegments(U, xyPoints, 0);
  PrintAnswerSegments(horizontalSegments);
  PrintAnswerSegments(verticalSegments);
  return 0;
}