#include<bits/stdc++.h>

using namespace std;
 
typedef long long int ll;
typedef long double ld;
#define f first
#define s second
#define pb push_back
#define pii pair<int, int>

 
const int N = 2e5 + 100;
const int inf = 1e9;
const ll mod =  998244353;

int main()
{
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    using st = array<array<int, 2>, 4>;
    st s, t;
    for (auto& v : s) for (auto& x : v) cin >> x;
    for (auto& v : t) for (auto& x : v) cin >> x;

    sort(s.begin(), s.end());
    sort(t.begin(), t.end());

    auto encode = [](st a) {
        sort(a.begin(), a.end());
        int res = 0;
        for (auto [x, y] : a) {
            res = res * 36 + x * 6 + y;
        }
        return res;
    };

    const int N = 36 * 36 * 36 * 36;
    vector<int> pre(N, -1), dis(N, 0);

    const int ss = encode(s);
    pre[encode(s)] = encode(s);
    queue<st> q;
    q.push(s);

    vector<array<int, 2>> dir{{0, 1}, {0, -1}, {1, 0}, {-1, 0}};
    vector has(6, vector(6, 0));
    while (!q.empty()) {
        auto u = q.front();
        // for (auto [x, y] : u) {
        //     cout << x << ' ' << y << ' ';
        // }
        // cout << endl;
        q.pop();

        int cs = encode(u);
        for (auto [x, y] : u) {
            has[x][y] = 1;
        }


        for (auto& [x, y] : u) {
            for (auto [dx, dy] : dir) {
                int ox = x, oy = y;
                has[x][y] = 0;
                int lx = x, ly = y;
                while (1) {
                    x += dx, y += dy;
                    if (x < 0 || x >= 6 || y < 0 || y >= 6 || has[x][y]) break;
                    lx = x, ly = y;
                }
                x = lx, y = ly;
                int ns = encode(u);
                if (pre[ns] == -1) {
                    pre[ns] = cs;
                    dis[ns] = dis[cs] + 1;
                    q.push(u);
                }
                x = ox, y = oy;
                has[x][y] = 1;
            }
        }

        for (auto [x, y] : u) {
            has[x][y] = 0;
        }
    }

    int fs = encode(t);
    assert(pre[fs] != -1);

    cout << dis[fs] << '\n';

    vector<array<int, 4>> ans;

    auto decode = [](int s) {
        st res;
        for (auto& [x, y] : res) {
            int r = s % 36;
            y = r % 6;
            x = r / 6;
            s /= 36;
        }
        return res;
    };

    int cs = fs;
    while (cs != ss) {
        auto cur = decode(cs);
        auto pr = decode(pre[cs]);
        set<array<int, 2>> ss(pr.begin(), pr.end());
        array<int, 2> rem;
        for (auto x : cur) {
            if (ss.count(x)) {
                ss.erase(x);
            } else {
                rem = x;
            }
        }
        assert(ss.size() == 1);

        auto [xx, yy] = *ss.begin();
        ans.push_back({xx, yy, rem[0], rem[1]});

        cs = pre[cs];
    }

    reverse(ans.begin(), ans.end());
    for (auto [a, b, c, d] : ans) {
        cout << a << ' ' << b << ' ' << c << ' ' << d << '\n';
    }
    return 0;
}