#include <bits/stdc++.h>
using namespace std;
int n;
struct P {
  int x, y;
  bool operator<(const P& r) const { return x < r.x || (x == r.x && y < r.y); }
  bool operator==(const P& r) const { return x == r.x && y == r.y; }
} p[1000005];
inline int read() {
  int x = 0, f = 1;
  char ch = getchar();
  while (ch > '9' || ch < '0') {
    if (ch == '-') f = -1;
    ch = getchar();
    if (ch == -1) return 0;
  }
  while (ch >= '0' && ch <= '9') {
    x = x * 10 + ch - '0';
    ch = getchar();
  }
  return x * f;
}
inline void write(int x) {
  if (x < 0) {
    putchar('-');
    x = -x;
  }
  if (x >= 10) write(x / 10);
  putchar(x % 10 + '0');
}
void solve(int l, int r) {
  if (l > r) return;
  int mid = (l + r) >> 1;
  for (int i = l; i <= r; i++) p[++n] = P{p[mid].x, p[i].y};
  solve(l, mid - 1), solve(mid + 1, r);
}
int main() {
  n = read();
  for (int i = 1, x, y; i <= n; i++) x = read(), y = read(), p[i] = P{x, y};
  sort(p + 1, p + n + 1), solve(1, n), sort(p + 1, p + n + 1);
  int m = unique(p + 1, p + n + 1) - (p + 1);
  printf("%d\n", m);
  for (int i = 1; i <= m; i++) printf("%d %d\n", p[i].x, p[i].y);
  return 0;
}
