#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 100;
int n, m, a[N];
pair<int, int> p[4];
set<pair<int, int> > ans;
int main() {
  for (int i = 0; i < 3; i++) cin >> p[i].first >> p[i].second;
  sort(p, p + 3);
  ans.insert(make_pair(p[0].first + p[1].first - p[2].first,
                       p[0].second + p[1].second - p[2].second));
  ans.insert(make_pair(p[0].first + p[2].first - p[1].first,
                       p[0].second + p[2].second - p[1].second));
  ans.insert(make_pair(p[1].first + p[0].first - p[2].first,
                       p[1].second + p[0].second - p[2].second));
  ans.insert(make_pair(p[1].first + p[2].first - p[0].first,
                       p[1].second + p[2].second - p[0].second));
  cout << ans.size() << endl;
  for (auto it : ans) cout << it.first << ' ' << it.second << endl;
}
