#include <bits/stdc++.h>
using namespace std;
struct thanks {
  int x, y, id;
} p[100005];
bool cmp(thanks x, thanks y) {
  if (x.x != y.x)
    return x.x < y.x;
  else
    return x.y < y.y;
}
bool ok(thanks x, thanks y, thanks z) {
  if (1LL * (y.y - x.y) * (z.x - y.x) != 1LL * (z.y - y.y) * (y.x - x.x))
    return 1;
  else
    return 0;
}
int main() {
  int i, j, n, m;
  scanf("%d", &n);
  for (i = 1; i <= n; i++) {
    scanf("%d%d", &p[i].x, &p[i].y);
    p[i].id = i;
  }
  sort(p + 1, p + n + 1, cmp);
  for (i = 3; i <= n; i++) {
    if (ok(p[i - 2], p[i - 1], p[i])) {
      printf("%d %d %d\n", p[i - 2].id, p[i - 1].id, p[i].id);
      return 0;
    }
  }
  return 0;
}
