#include <bits/stdc++.h>
// #include <ext/pb_ds/assoc_container.hpp> 
// #include <ext/pb_ds/tree_policy.hpp>
 
using namespace std;
// using namespace __gnu_pbds;
typedef long long ll;
typedef long double ld;
 
typedef pair<ll, ll> pl;
typedef pair<ld,ld> pd;
typedef vector<ll> vl;
// typedef tree<ll, null_type, less<ll>, rb_tree_tag, tree_order_statistics_node_update> ordered_set;
 
 
#define G(x) ll x; cin >> x;
#define F(i, l, r) for (ll i = l; i < (r); ++i)
#define all(a) begin(a), end(a)
#define K first
#define V second
#define OK(i,j) i >= 0 && i < n && j >= 0 && j < m
 
#define NN 2505
#define MM 5005
#define MOD 1000000007

set<ll> visited;
queue<ll> q;
map<ll,ll> depths;
map<ll,ll> par;

void solve() {
    ll start[8], finish[8];
    for(ll i=0;i<8;i++) cin >> start[i];
    for(ll i=0;i<8;i++) cin >> finish[i];

    ll cur = 0;
    for(ll i=0;i<4;i++) cur += (1ll << (6*start[2*i] + start[2*i+1ll]));

    visited.insert(cur);
    q.push(cur);
    depths[cur] = 0;
    par[cur] = 0;
    ll ct = 0;
    ll x = cur;

    while(!q.empty()) {
        cur = q.front();
        q.pop();
        ll c = depths[cur];
        ct++;

        ll idx = 0;
        while(idx < 36) {
            // if(x == cur) cout << "HI1\n";
            if(cur&(1ll << idx)) {
                cur ^= (1ll << idx);

                ll i = idx/6;
                ll j = idx%6;

                if(ct == 1) {
                    // cout << "HI2 " << (cur^(1ll << idx)) << ' ' << idx << '\n';
                }

                ll d = 0;
                while(i+d < 6 && !(cur&(1ll << 6*(i+d) + j))) d++;
                d--;
                if(visited.count(cur ^ (1ll << 6*(i+d) + j)) == 0) {
                    q.push(cur ^ (1ll << 6*(i+d) + j));
                    visited.insert(cur ^ (1ll << 6*(i+d) + j));
                    depths[cur ^ (1ll << 6*(i+d) + j)] = c+1;
                    par[cur ^ (1ll << 6*(i+d) + j)] = (cur ^ (1ll << idx));

                    // if(ct == 1) cout << 0 << ' ' << i << ' ' << j << ' ' << d << '\n';
                }

                d = 0;
                while(i-d >= 0 && !(cur&(1ll << 6*(i-d) + j))) d++;
                d--;
                if(visited.count(cur ^ (1ll << 6*(i-d) + j)) == 0) {
                    q.push(cur ^ (1ll << 6*(i-d) + j));
                    visited.insert(cur ^ (1ll << 6*(i-d) + j));
                    depths[cur ^ (1ll << 6*(i-d) + j)] = c+1;
                    par[cur ^ (1ll << 6*(i-d) + j)] = (cur ^ (1ll << idx));

                    // if(ct == 1) cout << 1 << ' ' << i << ' ' << j << ' ' << d << '\n';
                }

                d = 0;
                while(j+d < 6 && !(cur&(1ll << 6*i + j + d))) d++;
                d--;
                if(visited.count(cur ^ (1ll << 6*i + j + d)) == 0) {
                    q.push(cur ^ (1ll << 6*i + j + d));
                    visited.insert(cur ^ (1ll << 6*i + j + d));
                    depths[cur ^ (1ll << 6*i + j + d)] = c+1;
                    par[cur ^ (1ll << 6*i + j + d)] = (cur ^ (1ll << idx));

                    // if(ct == 1) cout << 2 << ' ' << i << ' ' << j << ' ' << d << '\n';
                }

                d = 0;
                while(j-d >= 0 && !(cur&(1ll << 6*i + j - d))) d++;
                d--;
                if(visited.count(cur ^ (1ll << 6*i + j - d)) == 0) {
                    q.push(cur ^ (1ll << 6*i + j - d));
                    visited.insert(cur ^ (1ll << 6*i + j - d));
                    depths[cur ^ (1ll << 6*i + j - d)] = c+1;
                    par[cur ^ (1ll << 6*i + j - d)] = (cur ^ (1ll << idx));

                    // if(ct == 1) cout << 3 << ' ' << i << ' ' << j << ' ' << d << '\n';
                }

                cur ^= (1ll << idx);
            }
            idx++;
        }
    }

    ll stop = 0;
    for(ll i=0;i<4;i++) stop += (1ll << (6*finish[2*i] + finish[2*i+1]));

    cout << depths[stop] << '\n';
    if(depths[stop] == 0) return;
    ll len = depths[stop];
    ll ans[len][4];
    ll k = 0;

    while(par[stop] != 0) {
        // cout << stop << ' ' << par[stop] << '\n';
        ll i1=0, j1=0, i2=0, j2=0;
        ll idx = 0;
        while(idx < 36) {
            if(((stop&(1ll << idx)) == 0) && ((par[stop]&(1ll << idx)) != 0)) {
                i1 = idx/6;
                j1 = idx%6;
            }
            else if(((stop&(1ll << idx)) != 0) && ((par[stop]&(1ll << idx)) == 0)) {
                i2 = idx/6;
                j2 = idx%6;
            }
            idx++;
        }

        stop = par[stop];
        ans[k][0] = i1;
        ans[k][1] = j1;
        ans[k][2] = i2;
        ans[k][3] = j2;
        k++;
        
    }

    reverse(ans,ans+len);

    for(ll i=0;i<len;i++) {
        for(ll j=0;j<4;j++) {
            cout << ans[i][j] << ' ';
        }
        cout << '\n';
    }

    // cout << ct << '\n';

}

int main() {
    cin.tie(0)->sync_with_stdio(0);
    cout << fixed << setprecision(10);

    solve();

    return 0;

}