#include <bits/stdc++.h>
using namespace std;
const int MAXN = 1e5 + 5;
pair<int, int> p[3];
set<pair<int, int>> ans;
int main() {
  for (int i = 0, x, y; i < 3; ++i) {
    scanf("%d%d", &x, &y);
    p[i].first = x;
    p[i].second = y;
  }
  sort(p, p + 3);
  do {
    pair<int, int> a, b;
    a.first = p[1].first - p[0].first;
    a.second = p[1].second - p[0].second;
    b.first = p[2].first - p[0].first;
    b.second = p[2].second - p[0].second;
    if (!(a.first * b.second - a.second * b.first)) continue;
    a.first += b.first;
    a.second += b.second;
    b.first = p[0].first + a.first;
    b.second = p[0].second + a.second;
    ans.insert(b);
  } while (next_permutation(p, p + 3));
  printf("%d\n", (int)ans.size());
  for (auto &p : ans) printf("%d %d\n", p.first, p.second);
  return 0;
}
