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

inline ll rd() {
	ll x = 0;
	bool f = 0;
	char c = getchar();
	for (; !isdigit(c); c = getchar()) f |= (c == '-');
	for (; isdigit(c); c = getchar()) x = x * 10 + (c ^ 48);
	return f ? -x : x;
} 

ll x[5], y[5], s[5];

#define abs(x) ((x) > 0 ? (x) : -(x))

#define mp make_pair
#define fr first
#define sc second
#define pb push_back

struct seg {
	ll a, b, c, d;
};

ll ans = 1e18, tmp;

vector<seg> q, tmpq;

void add(ll x1, ll y1, ll x2, ll y2) {
	if (x1 == x2 && y1 == y2) return;
	tmp += abs(x1 - x2) + abs(y1 - y2);
	tmpq.pb((seg){x1, y1, x2, y2});
}

int main() {
	for (int i = 0; i < 3; ++i) {
		x[i] = rd(); y[i] = rd();
	}
	ll mnx = min(min(x[0], x[1]), x[2]);
	ll mxx = max(max(x[0], x[1]), x[2]);
	ll mny = min(min(y[0], y[1]), y[2]);
	ll mxy = max(max(y[0], y[1]), y[2]);
	ll ans = 1e18;
	for (ll i = 0; i < 3; ++i) {
		ll j = (i == 0 ? 1 : 0);
		ll k = 3 - i - j;
		tmp = 0; tmpq.clear();
		add(mnx, y[i], mxx, y[i]);
		add(x[j], y[j], x[j], y[i]);
		add(x[k], y[k], x[k], y[i]);
		if (tmp < ans) {ans = tmp; q = tmpq;}
		tmp = 0; tmpq.clear();
		add(x[i], mny, x[i], mxy);
		add(x[j], y[j], x[i], y[j]);
		add(x[k], y[k], x[i], y[k]);
		if (tmp < ans) {ans = tmp; q = tmpq;}
	}
	printf("%lld\n", q.size());
	for (auto i : q) 
		printf("%lld %lld %lld %lld\n", i.a, i.b, i.c, i.d);
	return 0;
}