Problem: Now that Heidi has made sure her Zombie Contamination level checker works, it's time to strike! This time, the zombie lair is a strictly convex polygon on the lattice. Each vertex of the polygon occupies a point on the lattice. For each cell of the lattice, Heidi knows the level of Zombie Contamination – the number of corners of the cell that are inside or on the border of the lair.

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

<image>

Input

The input contains multiple test cases.

The first line of each test case contains one integer N, the size of the lattice grid (5 ≤ N ≤ 500). The next N lines each contain N characters, describing the level of Zombie Contamination of each cell in the lattice. Every character of every line is a digit between 0 and 4. 

Cells are given in the same order as they are shown in the picture above: rows go in the decreasing value of y coordinate, and in one row cells go in the order of increasing x coordinate. This means that the first row corresponds to cells with coordinates (1, N), ..., (N, N) and the last row corresponds to cells with coordinates (1, 1), ..., (N, 1).

The last line of the file contains a zero. This line should not be treated as a test case. The sum of the N values for all tests in one file will not exceed 5000.

Output

For each test case, give the following output:

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.

Examples

Input

8
00000000
00000110
00012210
01234200
02444200
01223200
00001100
00000000
5
00000
01210
02420
01210
00000
7
0000000
0122100
0134200
0013200
0002200
0001100
0000000
0


Output

4
2 3
2 4
6 6
5 2
4
2 2
2 3
3 3
3 2
3
2 5
4 5
4 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 2 and N - 2. 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;
template <class T>
int chkmax(T& a, T b) {
  if (b > a) {
    a = b;
    return 1;
  }
  return 0;
}
template <class T>
int chkmin(T& a, T b) {
  if (b < a) {
    a = b;
    return 1;
  }
  return 0;
}
template <class iterator>
void output(iterator begin, iterator end, ostream& out = cerr) {
  while (begin != end) {
    out << (*begin) << " ";
    begin++;
  }
  out << endl;
}
template <class T>
void output(T x, ostream& out = cerr) {
  output(x.begin(), x.end(), out);
}
void fast_io() {
  ios_base::sync_with_stdio(false);
  cin.tie(nullptr);
  cout.tie(nullptr);
}
struct pt {
  long long x, y;
  pt() : x(0), y(0) {}
  pt(long long _x, long long _y) : x(_x), y(_y) {}
};
pt operator+(pt a, pt b) { return pt(a.x + b.x, a.y + b.y); }
pt operator-(pt a, pt b) { return pt(a.x - b.x, a.y - b.y); }
long long operator*(pt a, pt b) { return a.x * b.x + a.y * b.y; }
long long operator/(pt a, pt b) { return a.x * b.y - a.y * b.x; }
istream& operator>>(istream& is, pt& p) {
  is >> p.x >> p.y;
  return is;
}
ostream& operator<<(ostream& os, const pt& p) {
  os << p.x << " " << p.y;
  return os;
}
bool operator<(pt a, pt b) { return make_pair(a.y, a.x) < make_pair(b.y, b.x); }
bool operator==(pt a, pt b) { return !(a < b) && !(b < a); }
int half_plane(pt a) { return !(a.y > 0 || (a.y == 0 && a.x > 0)); }
bool polar_cmp(pt a, pt b) {
  int ha = half_plane(a), hb = half_plane(b);
  if (ha < hb) {
    return true;
  }
  if (ha > hb) {
    return false;
  }
  return (a / b > 0);
}
pt base;
long long len(pt a) { return a * a; }
bool base_polar_cmp(pt a, pt b) {
  long long cross = (a - base) / (b - base);
  return (cross > 0 || (cross == 0 && len(a - base) < len(b - base)));
}
vector<pt> convex_hull(vector<pt>& a) {
  sort(a.begin(), a.end());
  a.erase(unique(a.begin(), a.end()), a.end());
  base = a[0];
  sort(a.begin() + 1, a.end(), base_polar_cmp);
  vector<pt> st;
  int n = a.size();
  for (int i = 0; i < n; ++i) {
    while (st.size() >= 2) {
      pt last = st.back() - st[st.size() - 2];
      pt next_vect = a[i] - st.back();
      if (last / next_vect <= 0) {
        st.pop_back();
      } else {
        break;
      }
    }
    st.push_back(a[i]);
  }
  return st;
}
const vector<pt> dir = {{0, 0}, {-1, 0}, {0, -1}, {-1, -1}};
const vector<pt> dir2 = {{0, 0}, {1, 0}, {0, 1}, {1, 1}};
int main() {
  fast_io();
  while (true) {
    int n, m;
    cin >> n >> m;
    if (n == 0) return 0;
    vector<pt> a(m);
    for (int i = 0; i < m; i++) cin >> a[i];
    map<int, int> mn, mx;
    for (int i = 0; i < m; i++) {
      int x = a[i].x, y = a[i].y;
      if (mn.find(x) == mn.end())
        mn[x] = y;
      else
        mn[x] = min(mn[x], y);
      if (mx.find(x) == mx.end())
        mx[x] = y;
      else
        mx[x] = max(mx[x], y);
    }
    vector<pt> pts;
    for (const pt& p : a) {
      for (const pt& delta : dir) {
        pt node = p + delta;
        bool is_ok = true;
        for (const pt& delta2 : dir2) {
          pt cell = node + delta2;
          if (mn.find(cell.x) == mn.end()) {
            is_ok = false;
            break;
          }
          if (mn[cell.x] > cell.y || mx[cell.x] < cell.y) {
            is_ok = false;
            break;
          }
        }
        if (is_ok) {
          pts.push_back(node);
        }
      }
    }
    auto ans = convex_hull(pts);
    reverse(ans.begin(), ans.end());
    int pos = min_element(ans.begin(), ans.end(),
                          [](const pt& a, const pt& b) {
                            return make_pair(a.x, a.y) < make_pair(b.x, b.y);
                          }) -
              ans.begin();
    rotate(ans.begin(), ans.begin() + pos, ans.end());
    cout << ans.size() << endl;
    for (const pt& p : ans) {
      cout << p << '\n';
    }
  }
}