Problem: Zombies have found out about the Zombie Contamination level checker and managed to damage it! Now detecting the shape of their main compound will be a real challenge for Heidi. As before, a lair can be represented as a strictly convex polygon on a lattice. Each vertex of the polygon occupies a point on the lattice. However, the damaged Zombie Contamination level checker can only tell, for each cell, whether the level of Zombie Contamination for that cell is in the set {1, 2, 3}. In other words, Heidi knows all the cells of the lattice for which the Contamination level is not 0 and not 4.

Given this information, Heidi still wants to know the exact shape of the lair to rain destruction on the zombies. Help her!

Input

The input contains multiple test cases.

The first line of each test case contains two space-separated integers N and M, where N is the size of the lattice grid (5 ≤ N ≤ 100000) and M is the number of lattice points for which the Zombie Contamination level is 1, 2, or 3 (8 ≤ M ≤ 200000).

The second line of each test case contains M pairs of integers x1, y1, ..., xM, yM – coordinates of the cells with Zombie Contamination level not equal to 0 nor 4. It is guaranteed that 1 ≤ xi, yi ≤ N. All pairs xi, yi are different.

Cells are enumerated based on the coordinates of their upper right corner. This means that the bottommost leftmost cell that touches the origin has coordinates (1, 1), and the uppermost leftmost cell is identified as (1, N).

The last line of the file contains two zeroes. This line should not be treated as a test case. The sum of the M values for all tests in one file will not exceed 200000.

Output

For each test case, the following output is expected:

The first line of the output should contain one integer V, the number of vertices of the polygon that is the secret lair. The next V lines each should contain two integers, denoting the vertices of the polygon in the clockwise order, starting from the lexicographically smallest vertex.

Example

Input

8 19
2 3 2 4 2 5 3 3 3 5 4 3 4 5 4 6 5 2 5 3 5 6 6 2 6 3 6 4 6 5 6 6 6 7 7 6 7 7
5 8
2 2 2 3 2 4 3 2 3 4 4 2 4 3 4 4
0 0


Output

4
2 3
2 4
6 6
5 2
4
2 2
2 3
3 3
3 2

Note

It is guaranteed that the solution always exists and is unique. It is guaranteed that in the correct solution the coordinates of the polygon vertices are between 1 and N - 1. A vertex (x1, y1) is lexicographically smaller than vertex (x2, y2) if x1 < x2 or <image>.

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
const double EPS = 1e-7;
struct PT {
  double x, y;
  PT() {}
  PT(double xx, double yy) : x(xx), y(yy) {}
  bool operator<(const PT &rhs) const {
    return make_pair(y, x) < make_pair(rhs.y, rhs.x);
  }
  bool operator==(const PT &rhs) const {
    return make_pair(y, x) == make_pair(rhs.y, rhs.x);
  }
};
double cross(PT p, PT q) { return p.x * q.y - p.y * q.x; }
double area2(PT a, PT b, PT c) {
  return cross(a, b) + cross(b, c) + cross(c, a);
}
bool between(const PT &a, const PT &b, const PT &c) {
  return (fabs(area2(a, b, c)) < EPS && (a.x - b.x) * (c.x - b.x) <= 0 &&
          (a.y - b.y) * (c.y - b.y) <= 0);
}
void ConvexHull(vector<PT> &pts) {
  sort(pts.begin(), pts.end());
  pts.erase(unique(pts.begin(), pts.end()), pts.end());
  vector<PT> up, dn;
  for (int i = 0; i < (int)pts.size(); i++) {
    while (up.size() > 1 && area2(up[up.size() - 2], up.back(), pts[i]) >= 0)
      up.pop_back();
    while (dn.size() > 1 && area2(dn[dn.size() - 2], dn.back(), pts[i]) <= 0)
      dn.pop_back();
    up.push_back(pts[i]);
    dn.push_back(pts[i]);
  }
  pts = dn;
  for (int i = (int)up.size() - 2; i >= 1; i--) pts.push_back(up[i]);
  if (pts.size() <= 2) return;
  dn.clear();
  dn.push_back(pts[0]);
  dn.push_back(pts[1]);
  for (int i = 2; i < (int)pts.size(); i++) {
    if (between(dn[dn.size() - 2], dn[dn.size() - 1], pts[i])) dn.pop_back();
    dn.push_back(pts[i]);
  }
  if (dn.size() >= 3 && between(dn.back(), dn[0], dn[1])) {
    dn[0] = dn.back();
    dn.pop_back();
  }
  pts = dn;
}
ostream &operator<<(ostream &os, PT p) { return os << p.y << ' ' << p.x; }
map<int, vector<int> > known;
map<int, vector<int> > known2;
int main() {
  int n, m;
  while (cin >> n >> m, n) {
    known.clear();
    known2.clear();
    for (int i = (0); i < (int)(m); i++) {
      int x, y;
      cin >> x >> y;
      known[x].push_back(y);
      known2[y].push_back(x);
    }
    for (auto kv : known) sort(kv.second.begin(), kv.second.end());
    for (auto kv : known2) sort(kv.second.begin(), kv.second.end());
    vector<PT> pts;
    for (auto kv : known) {
      int first = *(kv.second.begin());
      if (known.find(kv.first - 1) == known.end() ||
          *known[kv.first - 1].begin() > first) {
        pts.push_back({(double)(first), (double)(kv.first)});
      }
    }
    for (auto kv : known) {
      int first = *(kv.second.begin());
      if (known.find(kv.first + 1) == known.end() ||
          *known[kv.first + 1].begin() > first) {
        pts.push_back({(double)(first), (double)(kv.first - 1)});
      }
    }
    for (auto kv : known) {
      int first = *(kv.second.rbegin());
      if (known.find(kv.first - 1) == known.end() ||
          *known[kv.first - 1].rbegin() < first) {
        pts.push_back({(double)(first - 1), (double)(kv.first)});
      }
    }
    for (auto kv : known) {
      int first = *(kv.second.rbegin());
      if (known.find(kv.first + 1) == known.end() ||
          *known[kv.first + 1].rbegin() < first) {
        pts.push_back({(double)(first - 1), (double)(kv.first - 1)});
      }
    }
    ConvexHull(pts);
    cout << pts.size() << endl;
    for (int i = (0); i < (int)(pts.size()); i++) {
      cout << pts[i] << endl;
    }
  }
}