#include <bits/stdc++.h>
using namespace std;
const long long int Maxn3 = 1e3 + 10;
const long long int Maxn4 = 1e4 + 10;
const long long int Maxn5 = 1e5 + 10;
const long long int Maxn6 = 1e6 + 10;
const long long int Maxn7 = 1e7 + 10;
const long long int Maxn8 = 1e8 + 10;
const long long int Maxn9 = 1e9 + 10;
const long long int Maxn18 = 1e18 + 10;
const long long int Mod1 = 1e7 + 7;
const long long int Mod2 = 1e9 + 7;
const long long int LLMax = LLONG_MAX;
const long long int LLMin = LLONG_MIN;
const long long int INTMax = INT_MAX;
const long long int INTMin = INT_MIN;
long long int mn = LLMax, mx = LLMin;
set<pair<long long int, long long int> > nude;
pair<long long int, long long int> p[Maxn5];
void divide(long long int l, long long int r) {
  if (r - l < 2) return;
  long long int mid = (l + r) / 2;
  for (long long int i = l; i < r; i++)
    nude.insert(make_pair(p[mid].first, p[i].second));
  divide(l, mid);
  divide(mid, r);
  return;
}
int main() {
  ios_base::sync_with_stdio(false), cin.tie(NULL), cout.tie(NULL);
  long long int n;
  cin >> n;
  for (long long int i = 0; i < n; i++) {
    cin >> p[i].first >> p[i].second;
    nude.insert(p[i]);
  }
  sort(p, p + n);
  divide(0ll, n);
  cout << nude.size() << '\n';
  for (auto a : nude) cout << a.first << ' ' << a.second << '\n';
  return 0;
}
