#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define endl '\n'

#define move array<int,4>
#define grid array<array<int,6>, 6>

vector<move> find_valid_moves(grid &g){
	vector<move> v;
	for(int i=0; i<6; i++){
		for(int j=0; j<6; j++){
			if(g[i][j] == 0) continue;
			int jump;
			jump = i;
			while(jump+1 < 6 && g[jump+1][j] == 0) jump++;
			if(jump != i){
				v.push_back({i,j,jump,j});
			}
			jump = i;
			while(jump-1 >= 0 && g[jump-1][j] == 0) jump--;
			if(jump != i){
				v.push_back({i,j,jump,j});
			}
			jump = j;
			while(jump+1 < 6 && g[i][jump+1] == 0) jump++;
			if(jump != j){
				v.push_back({i,j,i,jump});
			}
			jump = j;
			while(jump-1 >= 0 && g[i][jump-1] == 0) jump--;
			if(jump != j){
				v.push_back({i,j,i,jump});
			}
			
		}
	}
	return v;
}

int main(){
	ios::sync_with_stdio(false); cin.tie(0);
	grid start_grid, end_grid;
	for(int i=0; i<6; i++){
		for(int j=0; j<6; j++){
			start_grid[i][j] = 0;
			end_grid[i][j] = 0;
		}
	}
	
	for(int i=0; i<4; i++){
		int r, c;
		cin >> r >> c;
		start_grid[r][c] = 1;
	}
	for(int i=0; i<4; i++){
		int r, c;
		cin >> r >> c;
		end_grid[r][c] = 1;
	}
	map<grid, move> mp;
	queue<grid> q;
	mp[start_grid] = {-1,-1,-1,-1};
	q.push(start_grid);
	while(!q.empty()){
		grid cur = q.front(); q.pop();
		if(cur == end_grid) break;
		vector<move> v = find_valid_moves(cur);
		for(move &m : v){
			assert(cur[m[0]][m[1]] == 1);
			assert(cur[m[2]][m[3]] == 0);
			cur[m[0]][m[1]] = 0;
			cur[m[2]][m[3]] = 1;
			if(!mp.count(cur)){
				// cout << "Move " << m[0] << ',' << m[1] << " to " << m[2] << ',' << m[3] << endl;
				mp[cur] = m;
				q.push(cur);
			}
			cur[m[0]][m[1]] = 1;
			cur[m[2]][m[3]] = 0;
		}
		// break;
	}
	vector<move> ans;
	grid cur = end_grid;
	while(cur != start_grid){
		assert(mp.count(cur));
		ans.push_back(mp[cur]);
		auto [er, ec, sr, sc] = mp[cur];
		assert(cur[sr][sc] == 1);
		assert(cur[er][ec] == 0);
		cur[sr][sc] = 0;
		cur[er][ec] = 1;
	}
	reverse(ans.begin(), ans.end());
	cout << ans.size() << endl;
	for(auto &[sr,sc,er,ec] : ans){
		cout << sr << ' ' << sc << ' ' << er << ' ' << ec << endl;
	}
	
}