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

#define _P(...) (void)printf(__VA_ARGS__)
#define FOR(x,to) for(x=0;x<(to);x++)
#define FORR(x,arr) for(auto& x:arr)
#define FORR2(x,y,arr) for(auto& [x,y]:arr)
#define ALL(a) (a.begin()),(a.end())
#define ZERO(a) memset(a,0,sizeof(a))
#define MINUS(a) memset(a,0xff,sizeof(a))
template<class T> bool chmax(T &a, const T &b) { if(a<b){a=b;return 1;}return 0;}
template<class T> bool chmin(T &a, const T &b) { if(a>b){a=b;return 1;}return 0;}
//-------------------------------------------------------

int PX,PY;
int QX,QY;
int RX,RY;
vector<pair<int,int>> V;

void solve() {
	int i,j,k,l,r,x,y; string s;
	
	cin>>PX>>PY>>QX>>QY>>RX>>RY;
	PX*=2;
	PY*=2;
	QX*=2;
	QY*=2;
	RX*=2;
	RY*=2;
	for(x=-200;x<=400;x++) for(y=-200;y<=400;y++) {
		if(abs(PX-x)+abs(PY-y)!=abs(QX-x)+abs(QY-y)) continue;
		if(abs(PX-x)+abs(PY-y)!=abs(RX-x)+abs(RY-y)) continue;
		if(abs(QX-x)+abs(QY-y)!=abs(RX-x)+abs(RY-y)) continue;
		V.push_back({x,y});
	}
	
	if(V.empty()) cout<<0<<endl;
	else if(V.size()>1) cout<<-1<<endl;
	else {
		cout<<1<<endl;
		cout<<V[0].first/2<<" "<<V[0].second/2<<endl;
	}
	
}


int main(int argc,char** argv){
	string s;int i;
	if(argc==1) ios::sync_with_stdio(false), cin.tie(0);
	FOR(i,argc-1) s+=argv[i+1],s+='\n'; FOR(i,s.size()) ungetc(s[s.size()-1-i],stdin);
	cout.tie(0); solve(); return 0;
}