#include <bits/stdc++.h>
using namespace std;
struct node {
  int x, y;
  node() {}
  node(int x, int y) : x(x), y(y) {}
} a[3], ans[3];
bool cmp(const node& a, const node& b) {
  if (a.y == b.y) return a.x > b.x;
  return a.y < b.y;
}
int main() {
  for (int i = 0; i < 3; i++) scanf("%d%d", &a[i].x, &a[i].y);
  ans[0].x = a[0].x + a[1].x - a[2].x;
  ans[0].y = a[0].y + a[1].y - a[2].y;
  ans[1].x = a[0].x - a[1].x + a[2].x;
  ans[1].y = a[0].y - a[1].y + a[2].y;
  ans[2].x = a[1].x + a[2].x - a[0].x;
  ans[2].y = a[1].y + a[2].y - a[0].y;
  printf("3\n");
  for (int i = 0; i < 3; i++) printf("%d %d\n", ans[i].x, ans[i].y);
  return 0;
}
