//A tree without skin will surely die.
//A man without face is invincible.
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <bits/stdc++.h>

#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define sz(S) ((int)S.size())
#define FOR(i, st_, n) for(int i = st_; i < n; ++i)
#define RFOR(i, n, end_) for(int i = (n)-1; i >= end_; --i)
#define x first
#define y second
#define pb push_back
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll> pll;
typedef pair<int, int> pii;
typedef pair<double, double> pdd;
typedef unsigned long long ull;
typedef long double LD;
typedef pair<ull, ull> pull;
using namespace __gnu_pbds;
typedef tree<ll, null_type, less<>, rb_tree_tag, tree_order_statistics_node_update> ordered_set;
using namespace std;
#ifdef ONPC
mt19937 rnd(228);
#else
mt19937 rnd(chrono::high_resolution_clock::now().time_since_epoch().count());
#endif



struct Move
{
	int x1, y1;
	int x2, y2;
};

map<vector<pii>, int> cost;
map<vector<pii>, pair<vector<pii>, Move>> pr;


int solve()
{
	vector<pii> st(4);
	vector<pii> end(4);
	FOR(i,0,4)if(!(cin>>st[i].x>>st[i].y))return 1;
	FOR(i,0,4)cin>>end[i].x>>end[i].y;
	
	sort(all(st));
	sort(all(end));
    queue<pair<int,vector<pii>>> Q;
    Q.push({0,st});
    cost[st]=0;
    vector<pii> D={ {-1,0}, {1, 0}, {0, 1}, {0,-1}};
    while(!Q.empty())
    {
		auto [d, vec]=Q.front();
		Q.pop();
		if(vec==end)
			break;
		for(const auto& [X,Y]: vec)
		{
			vector<pii> restt;
			for(auto [xx,yy]: vec)
			{
				if(!(xx==X && yy==Y))restt.pb({xx,yy});
			}
			assert(sz(restt)==3);
			for(const auto& [dx, dy]: D)
			{
				auto rest=restt;
				
				auto x=X,y=Y;
				while(x+dx >= 0 && x+dx < 6 && y+dy>=0 && y+dy < 6)
				{
					bool tobreak=false;
					for(auto [xx,yy]:restt)
					{
						if(xx==x+dx && yy==y+dy)
						{
							tobreak=true;
							break;
						}
					}
					if(tobreak)break;
					x+=dx,y+=dy;
				}
				rest.pb({x,y});
				sort(all(rest));
				auto it=cost.find(rest);
				assert(sz(rest)==4);
				assert(sz(rest) == sz(set<pii>(all(rest))));
				if(it==cost.end())
				{
					cost[rest]=d+1;
					Q.push({d+1, rest});
					pr[rest]={vec, {X,Y,x,y}};
				}
			}
		}
	}

	vector<Move> moves;
	
	while(end != st)
	{
		auto [par, move]=pr[end];
		moves.pb(move);
		end=par;
	}
	reverse(all(moves));
	cout<<sz(moves)<<'\n';
	for(auto[x1,y1,x2,y2]: moves)
	{
		cout<<x1<<" "<<y1<<" "<<x2<<" "<<y2<<'\n';
	}
	return 0;
}

int32_t main()
{
    ios::sync_with_stdio(0);
    cin.tie(0);
    int TET = 1e9;
    //cin >> TET;
    for (int i = 1; i <= TET; i++)
    {
        if (solve())
        {
            break;
        }
#ifdef ONPC
        cout << "__________________________" << endl;
#endif
    }
#ifdef ONPC
    cerr << endl << "finished in " << clock() * 1.0 / CLOCKS_PER_SEC << " sec" << endl;
#endif
}