#include <bits/stdc++.h>
using namespace std;
const long long MAXN = 1e4 + 10;
long long n, x, y;
pair<long long, long long> point[MAXN];
set<pair<long long, long long> > ans;
void solve(long long l, long long r) {
  if (r - l <= 1) return;
  long long mid = (l + r) / 2;
  for (long long i = l; i < r; i++)
    ans.insert(make_pair(point[mid].first, point[i].second));
  solve(l, mid), solve(mid, r);
  return;
}
int32_t main() {
  cin >> n;
  for (long long i = 0; i < n; i++)
    cin >> x >> y, point[i] = make_pair(x, y), ans.insert(make_pair(x, y));
  sort(point, point + n), solve(0, n), cout << (long long)ans.size() << endl;
  for (auto it : ans) cout << it.first << " " << it.second << endl;
  return 0;
}
