#include <bits/stdc++.h>
using namespace std;
const int maxn = 3e5 + 5;
const int INF = 0x3f3f3f3f;
pair<int, int> p[maxn];
set<pair<int, int> > s;
void dfs(int l, int r) {
  int mid = (l + r) >> 1;
  for (int i = l; i <= r; i++) {
    s.insert(make_pair(p[mid].first, p[i].second));
  }
  if (l < mid) dfs(l, mid - 1);
  if (r > mid) dfs(mid + 1, r);
}
int main() {
  int n;
  scanf("%d", &n);
  for (int i = 1; i <= n; i++) {
    scanf("%d%d", &p[i].first, &p[i].second);
  }
  sort(p + 1, p + n + 1);
  dfs(1, n);
  set<pair<int, int> >::iterator it;
  printf("%d\n", s.size());
  for (it = s.begin(); it != s.end(); it++) {
    printf("%d %d\n", it->first, it->second);
  }
  return 0;
}
