#include <bits/stdc++.h>
using namespace std;
vector<pair<int, int> > get(vector<pair<int, int> > &v) {
  int n = v.size();
  if (n == 1) {
    return v;
  }
  sort(v.begin(), v.end());
  int X = v[n / 2].first;
  vector<pair<int, int> > res;
  for (int i = 0; i < n; i++) res.push_back(make_pair(X, v[i].second));
  vector<pair<int, int> > v1;
  for (int i = 0; i < n / 2; i++) {
    v1.push_back(make_pair(v[i].second, v[i].first));
  }
  v1 = get(v1);
  for (int i = 0; i < (int)v1.size(); i++) {
    res.push_back(make_pair(v1[i].second, v1[i].first));
  }
  v1.clear();
  for (int i = n / 2; i < n; i++) {
    v1.push_back(make_pair(v[i].second, v[i].first));
  }
  v1 = get(v1);
  for (int i = 0; i < (int)v1.size(); i++) {
    res.push_back(make_pair(v1[i].second, v1[i].first));
  }
  return res;
}
int main(void) {
  int n;
  vector<pair<int, int> > v;
  scanf("%d", &n);
  for (int i = 0; i < n; i++) {
    int x, y;
    scanf("%d%d", &x, &y);
    v.push_back(make_pair(x, y));
  }
  vector<pair<int, int> > res = get(v);
  sort(res.begin(), res.end());
  res.resize(unique(res.begin(), res.end()) - res.begin());
  printf("%d\n", (int)res.size());
  for (int i = 0; i < (int)res.size(); i++) {
    printf("%d %d\n", res[i].first, res[i].second);
  }
  return 0;
}
