// Timothy Chan    "ch3dquartic.cc"    12/02    3-d lower hull (in C++)

// O(n^4) brute-force algorithm

//   input/output: see "ch3d.cc"
//   warning: ignores degeneracies and robustness


#include <stream.h>

struct Point { double x, y, z; };

inline double turn(Point p, Point q, Point r) {  // <0 iff cw
  return (q.x-p.x)*(r.y-p.y) - (r.x-p.x)*(q.y-p.y);
}

inline double orient(Point p, Point q, Point r, Point s) {
  // <0 iff s is above pqr, assuming pqr is cw
  return (q.z-p.z)*turn(p,r,s) - (r.z-p.z)*turn(p,q,s) +
         (s.z-p.z)*turn(p,q,r);
}

main() {

  int n, i, j, k, l;  
  cin >> n;

  Point *P = new Point[n]; 
  for (i = 0; i < n; i++) { cin >> P[i].x; cin >> P[i].y; cin >> P[i].z; }

  for (i = 0; i < n; i++)
    for (j = i+1; j < n; j++)
      for (k = i+1; k < n; k++) {  
        if (turn(P[i],P[j],P[k]) >= 0) continue;
        for (l = 0; l < n; l++)  // check facet ijk
          if (orient(P[i],P[j],P[k],P[l]) > 0) break;
        if (l == n) cout << i << " " << j << " " << k << "\n";
      }
  delete P;
}