#include <bits/stdc++.h>
using namespace std;
const double EPS = 1e-9;
const double pi = acos(-1.0);
const int MAXN = (int)5e5 + 7;
const long long INF = (long long)1e9 + 7;
const long long LINF = (long long)1e18 + 7;
const long long MOD = (long long)1e9 + 7;
;
const long long P = 31;
const long long SZ = (long long)1e5;
const int K = 8;
int main() {
  pair<int, int> a[3];
  cin >> a[0].first >> a[0].second >> a[1].first >> a[1].second >> a[2].first >>
      a[2].second;
  set<pair<int, int> > s;
  for (int i = 0; i < 3; ++i)
    for (int j = 0; j < 3; ++j)
      for (int k = 0; k < 3; ++k)
        if (i != j && k != j && k != i) {
          s.insert(make_pair(a[k].first + a[i].first - a[j].first,
                             a[k].second + a[i].second - a[j].second));
          s.insert(make_pair(a[k].first - a[i].first + a[j].first,
                             a[k].second - a[i].second + a[j].second));
        }
  cout << s.size() << endl;
  for (auto it = s.begin(); it != s.end(); ++it)
    cout << it->first << ' ' << it->second << endl;
}
