#include <bits/stdc++.h>
using namespace std;
const int inf = 1e9;
int main() {
  ios::sync_with_stdio(false);
  int n = 3;
  vector<pair<int, int> > ps(n, pair<int, int>(0, 0));
  for (int i = 0; i < n; i++) cin >> ps[i].first >> ps[i].second;
  set<pair<int, int> > forth;
  for (int i = 0; i < n; i++)
    for (int j = i + 1; j < n; j++) {
      int dx = ps[i].first - ps[j].first;
      int dy = ps[i].second - ps[j].second;
      for (int k = 0; k < n; k++)
        if (k != i && k != j) {
          forth.insert(pair<int, int>(ps[k].first + dx, ps[k].second + dy));
          forth.insert(pair<int, int>(ps[k].first - dx, ps[k].second - dy));
        }
    }
  cout << forth.size() << endl;
  for (auto &p : forth) cout << p.first << ' ' << p.second << endl;
  return 0;
}
