#include <bits/stdc++.h>
using namespace std;
struct p {
  long long int x, y;
  int num;
} q[100005];
int cmp(p a, p b) {
  if (a.y == b.y) return a.x < b.x;
  return a.y < b.y;
}
int j(int t) {
  return (q[1].x - q[t].x) * (q[2].y - q[t].y) -
             (q[1].y - q[t].y) * (q[2].x - q[t].x) ==
         0;
}
int main() {
  int n, i;
  scanf("%d", &n);
  for (i = 1; i <= n; i++) {
    scanf("%lld%lld", &q[i].x, &q[i].y);
    q[i].num = i;
  }
  sort(q + 1, q + n + 1, cmp);
  i = 3;
  while (i <= n && j(i)) i++;
  printf("%d %d %d\n", q[1].num, q[2].num, q[i].num);
  return 0;
}
