#include <bits/stdc++.h>
using namespace std;
int n;
struct point {
  int x, y;
  point() {}
  point(int _x, int _y) : x(_x), y(_y) {}
  bool operator<(const point &b) const {
    if (y != b.y) return y < b.y;
    return x < b.x;
  }
} p[10005];
set<point> s;
set<point>::iterator it;
void dfs(int l, int r) {
  if (l == r) return;
  int mid = l + r >> 1;
  for (int i = l; i <= r; i++) s.insert(point(p[i].x, p[mid].y));
  dfs(l, mid);
  dfs(mid + 1, r);
}
int main() {
  scanf("%d", &n);
  for (int i = 1; i <= n; i++) {
    scanf("%d%d", &p[i].x, &p[i].y);
    s.insert(p[i]);
  }
  sort(p + 1, p + n + 1);
  dfs(1, n);
  cout << s.size() << endl;
  for (it = s.begin(); it != s.end(); it++)
    cout << it->x << " " << it->y << endl;
  return 0;
}
