#include <bits/stdc++.h>
using namespace std;
inline int in() {
  int x;
  scanf("%d", &x);
  return x;
}
vector<pair<int, int> > solve(vector<pair<int, int> > l) {
  if (l.size() <= 1) return l;
  vector<pair<int, int> > r;
  int mid = (int)l.size() / 2;
  while (l.size() > mid) r.push_back(l.back()), l.pop_back();
  int t = l.back().first;
  l = solve(l);
  r = solve(r);
  int sz = (int)l.size();
  for (int i = 0; i < sz; i++) l.push_back({t, l[i].second});
  for (int i = 0; i < r.size(); i++) l.push_back({t, r[i].second});
  for (int i = 0; i < r.size(); i++) l.push_back(r[i]);
  sort(l.begin(), l.end());
  l.resize(unique(l.begin(), l.end()) - l.begin());
  return l;
}
int32_t main() {
  int n;
  cin >> n;
  vector<pair<int, int> > v;
  for (int i = 0; i < n; i++) {
    pair<int, int> x;
    x.first = in(), x.second = in();
    v.push_back(x);
  }
  sort(v.begin(), v.end());
  vector<pair<int, int> > ans = solve(v);
  cout << ans.size() << endl;
  for (auto i : ans) cout << i.first << ' ' << i.second << endl;
}
