#include <bits/stdc++.h>
using namespace std;

using ld = long double;
using pii = pair<int, int>;
const ld EPS = 1e-7;
struct P3{
  ld x, y, z;
  P3() {
    this->x = 0; this->y = 0; this->z = 0;
  }
  explicit P3(ld x, ld y, ld z) {
    this->x = x;
    this->y = y;
    this->z = z;
  }
  ld dot(P3 v){
    return v.x*this->x + v.y*this->y + v.z*this->z;
  }
  P3 cross(P3 v) {
    return P3(this->y*v.z - this->z*v.y, this->z*v.x - this->x*v.z, this->x*v.y - this->y*v.x);
  }
};
P3 operator-(P3 l, const P3& r) {
  return P3(l.x - r.x, l.y - r.y, l.z - r.z);
}
P3 operator+(P3 l, const P3& r) {
  return P3(l.x + r.x, l.y + r.y, l.z + r.z);
}

void solve() {
  vector<P3> a(6);
  for (int i = 0; i < 6; i++) {
    cin >> a[i].x >> a[i].y >> a[i].z;
  }
  vector<pii> ans;
  for (int b = 0; b < (1<<6); b++) {
    int cnt = 0;
    vector<int> T1;
    vector<int> T2;
    vector<P3> t1;
    vector<P3> t2;
    for (int i = 0; i < 6; i++) {
      if (b & (1<<i)) {
        t1.push_back(a[i]);
        T1.push_back(i);
      }
      else {
        t2.push_back(a[i]);
        T2.push_back(i);
      }
    }
    if (t1.size() != 3) continue;

    P3 A = t1[0];
    for (int i = 0; i < 3; i++) {
      t1[i] = t1[i] - A;
      t2[i] = t2[i] - A;
    }
    P3 normal = t1[1].cross(t1[2]);
    // edge intersection
    int noedges = 0;
    cnt = 0;
    for (int i = 0; i < 3; i++) {
      int j= (i+1)%3;
      P3 edge = t2[j] - t2[i];
      if (abs(edge.dot(normal)) < EPS) continue;
      ld t = -1*(t2[i].dot(normal))/(edge.dot(normal));
      if (t > 0 && t <= 1) {
        P3 intp = t2[i] + P3(t*edge.x, t*edge.y, t*edge.z);
        // cout << intp.x << ' ' << intp.y << ' ' << intp.z << endl;
        // check if intp is in t1
        int sidescnt = 0;
        for (int k = 0; k < 3; k++) {
          int l = (k+1)%3;
          P3 r = (t1[l] - intp).cross(t1[k] - intp);
          sidescnt += (r.dot(normal) > EPS);
        }
        sidescnt %= 3;
        if (sidescnt > 0) continue;
        noedges++;
      }
    }
    if (noedges == 1) {
      if (b & 1) {
        ans.emplace_back(min(T1[1], T1[2])+1, max(T1[1], T1[2])+1);
        // cout << "edge" << endl;
      }
      continue;
    }

    // one vertex lies in the interior
    bool good = false;
    for (int i = 0; i < 3; i++) {
      if (abs(t2[i].dot(normal)) > EPS) continue;
      P3 intp = t2[i];
      // check if intp is in t1
      int sidescnt = 0;
      for (int k = 0; k < 3; k++) {
        int l = (k+1)%3;
        P3 r = (t1[l] - intp).cross(t1[k] - intp);
        sidescnt += (r.dot(normal) > 0);
      }
      sidescnt %= 3;
      if (sidescnt > 0) continue;
      vector<bool> thingy;
      for (int j = 0; j < 3; j++) {
        if (j == i) continue;
        // if ((t2[j] - t2[i]).dot(normal) == 0) continue;
        thingy.push_back((t2[j] - t2[i]).dot(normal) > 0);
      }
      if (thingy.size() != 2) continue;
      if (thingy[0] == thingy[1]) continue;
      good = true;
      break;
    }
    if (good) {
      if (b & 1) {
        ans.emplace_back(min(T1[1], T1[2])+1, max(T1[1], T1[2])+1);
        // cout << "vertex" << endl;
      }
      continue;
    }
  }
  sort(ans.begin(), ans.end());
  cout << ans.size() << endl;
  for (pii x : ans) {
    cout << x.first << ' ' << x.second << endl;
  }
}

int main(){
  cin.tie(0)->sync_with_stdio(0);
  solve();
}