// 

#include <bits/stdc++.h>
using namespace std;

using ll = long long;

#define rep(i, n) for (int i=0; i<(int)(n); ++(i))
#define rep3(i, m, n) for (int i=(m); (i)<(int)(n); ++(i))
#define repr(i, n) for (int i=(int)(n)-1; (i)>=0; --(i))
#define rep3r(i, m, n) for (int i=(int)(n)-1; (i)>=(int)(m); --(i))
#define all(x) (x).begin(), (x).end()

const int INF = (int)(1e9);
const vector<int> dx = { -1, 0, 1, 0 }, dy = { 0, 1, 0, -1 };

int main() {
    int n, ax, ay, bx, by, cx, cy;
    cin >> n >> ax >> ay >> bx >> by >> cx >> cy;
    --ax; --ay; --bx; --by; --cx; --cy;
    vector<string> d(n, string(n, '.'));
    auto is_connected = [&](int sx, int sy, int gx, int gy) -> bool {
        vector<vector<bool>> visited(n, vector<bool>(n));
        queue<pair<int, int>> que;
        visited[sx][sy] = true;
        que.emplace(sx, sy);
        while (!que.empty()) {
            auto [vx, vy] = que.front(); que.pop();
            rep(i2, 4) {
                int nx = vx + dx[i2], ny = vy + dy[i2];
                if (nx<0 || nx>=n || ny<0 || ny>=n || d[nx][ny] != '.' || visited[nx][ny]) continue;
                visited[nx][ny] = true;
                que.emplace(nx, ny);
            }
        }
        return visited[gx][gy];
    };
    vector<pair<int, int>> res;
    rep3r(i, 1, 1<<4) {
        vector<pair<int, int>> vlst;
        rep(j, 4) if (i>>j&1) {
            int tx = cx + dx[j], ty = cy + dy[j];
            d[tx][ty] = '#';
            vlst.emplace_back(tx+1, ty+1);
        }
        if (!is_connected(cx, cy, ax, ay) && is_connected(bx, by, ax, ay)) {
            res = vlst;
            break;
        }
        rep(j, 4) {
            int tx = cx + dx[j], ty = cy + dy[j];
            d[tx][ty] = '.';
        }
    }
    int m = res.size();
    cout << m << endl;
    rep(i, m) cout << res[i].first << ' ' << res[i].second << endl;
    return 0;
}