#include <bits/stdc++.h>
using namespace std;
const long long int MOD = 1000000007LL;
void swap(int *a, int *b) {
  int temp = *a;
  *a = *b;
  *b = temp;
}
long long int power(long long int a, long long int b) {
  long long int x = 1;
  long long int y = a;
  while (b > 0) {
    if (b & 1) {
      x = x * y;
      x %= 1000000007;
    }
    y = y * y;
    y %= 1000000007;
    b /= 2;
  }
  return x;
}
long long int add(long long int a, long long int b, long long int m = MOD) {
  long long int x = a + b;
  while (x >= m) x -= m;
  while (x < 0) x += m;
  return x;
}
long long int sub(long long int a, long long int b, long long int m = MOD) {
  long long int x = a - b;
  while (x < 0) x += m;
  while (x >= m) x -= m;
  return x;
}
long long int mul(long long int a, long long int b, long long int m = MOD) {
  long long int x = a * 1ll * b;
  x %= m;
  if (x < 0) x += m;
  return x;
}
pair<int, int> solve(pair<int, int> a, pair<int, int> b, pair<int, int> c) {
  int x = c.first - a.first;
  x = b.first + x;
  int y = c.second - a.second;
  y = b.second + y;
  return make_pair(x, y);
}
int main() {
  pair<int, int> a[3];
  cin >> a[0].first >> a[0].second;
  cin >> a[1].first >> a[1].second;
  cin >> a[2].first >> a[2].second;
  set<pair<int, int> > s;
  pair<int, int> temp;
  temp = solve(a[0], a[1], a[2]);
  s.insert(temp);
  temp = solve(a[1], a[0], a[2]);
  s.insert(temp);
  temp = solve(a[2], a[0], a[1]);
  s.insert(temp);
  cout << s.size() << endl;
  set<pair<int, int> >::iterator it;
  for (it = s.begin(); it != s.end(); ++it)
    cout << it->first << " " << it->second << endl;
  return 0;
}
