#include <bits/stdc++.h>
using namespace std;
struct pos {
  int x;
  int y;
};
int p1x, p2x, p3x, p1y, p2y, p3y;
bool not_op(pos i);
bool notin_line1(pos i);
bool notin_line2(pos i);
int st(const pos &a, const pos &b);
int main(void) {
  vector<pos> result;
  pos t2, t1, t3;
  while (cin >> p1x >> p1y >> p2x >> p2y >> p3x >> p3y) {
    result.clear();
    if (p1x == 0 && p2x == 0 && p3x == 0) {
      cout << "0" << endl;
      continue;
    }
    t1.x = p3x;
    t1.y = p3y;
    t2.x = p1x;
    t2.y = p1y;
    if ((!notin_line1(t1)) || (!notin_line2(t2))) {
      cout << "0" << endl;
      continue;
    }
    t1.x = p1x + p2x - p3x;
    t1.y = p1y + p2y - p3y;
    t2.x = p1x + p3x - p2x;
    t2.y = p1y + p3y - p2y;
    t3.x = p3x + p2x - p1x;
    t3.y = p3y + p2y - p1y;
    if (not_op(t1) && notin_line1(t1) && notin_line2(t1)) result.push_back(t1);
    if (not_op(t2) && notin_line1(t2) && notin_line2(t2)) result.push_back(t2);
    if (not_op(t3) && notin_line1(t3) && notin_line2(t3)) result.push_back(t3);
    sort(result.begin(), result.end(), st);
    cout << result.size() << endl;
    for (int i = 0; i < result.size(); i++) {
      cout << result[i].x << " " << result[i].y << endl;
    }
  }
  return 0;
}
int st(const pos &a, const pos &b) {
  if (a.x > b.x) return 0;
  if (a.x == b.x) {
    if (a.y > b.y) return 0;
  }
  return 1;
}
bool not_op(pos i) {
  if (i.x == p1x && i.y == p1y) return false;
  if (i.x == p2x && i.y == p2y) return false;
  if (i.x == p3x && i.y == p3y) return false;
  return true;
}
bool notin_line1(pos i) {
  double k, b;
  if (p2x - p1x != 0) {
    k = double(p2y - p1y) / (p2x - p1x);
    b = p1y - p1x * double(p2y - p1y) / (p2x - p1x);
    if (i.y == k * i.x + b) return false;
    return true;
  }
  if (i.x == p2x) return false;
  return true;
}
bool notin_line2(pos i) {
  double k, b;
  if (p2x - p3x != 0) {
    k = double(p2y - p3y) / (p2x - p3x);
    b = p3y - p3x * double(p2y - p3y) / (p2x - p3x);
    if (i.y == k * i.x + b) return false;
    return true;
  }
  if (i.x == p2x) return false;
  return true;
}
