#include using namespace std; #define all(v) (v).begin(),(v).end() #define pb emplace_back #define rep(i, n) for(int i=0;i<(n);i++) #define foa(e, v) for(auto& e : v) #define dout(a) cout< using pqr = priority_queue, greater>; template inline bool chmax(T1 &a, T2 b) { bool compare = a < b; if(compare) a = b; return compare; } template inline bool chmin(T1 &a, T2 b) { bool compare = a > b; if(compare) a = b; return compare; } template inline T back(std::set &s) { return *s.rbegin(); } template inline T back(std::multiset &s) { return *s.rbegin(); } template inline T pop_back(std::set &s) { auto it = prev(s.end()); T val = *it; s.erase(it); return val; } template inline T pop_back(std::multiset &s) { auto it = prev(s.end()); T val = *it; s.erase(it); return val; } const int dy[8] = {-1, 0, 0, 1, 1, -1, 1, -1}; const int dx[8] = {0, -1, 1, 0, -1, -1, 1, 1}; const ll MOD7 = 1000000007, MOD998 = 998244353, INF = (3LL << 59); const int inf = 1 << 30; const char br = '\n'; void solve() { vector v(6); rep(i, 6) { cin >> v[i]; v[i] *= 4; } auto dis = [&](ll x1, ll y1, ll x2, ll y2) -> ll { return abs(x1 - x2) + abs(y1 - y2); }; vector> ans; for(ll i = -1000; i <= 2000; i ++) { for(ll j = -1000; j <= 2000; j ++) { if(dis(i, j, v[0], v[1]) == dis(i, j, v[2], v[3]) and dis(i, j, v[2], v[3]) == dis(i, j, v[4], v[5])) { ans.pb(i, j); if((int)ans.size() >= 2) { cout << -1 << endl; return; } } } } cout << ans.size() << endl; ld inv = ld(1) / ld(4); for(auto [x, y] : ans) { dout(inv * ld(x)); cout << " "; dout(inv * ld(y)); cout << endl; } } int main() { cin.tie(0); ios::sync_with_stdio(false); int testcase = 1; // cin >> testcase; while(testcase --) solve(); return 0; }