#include <bits/stdc++.h>
using namespace std;
struct node {
  long long x, y;
  int id;
} p[111111];
int n;
int cmp(node a, node b) {
  if (a.x != b.x) return a.x < b.x;
  return a.y < b.y;
}
bool check(node a, node b, node c) {
  return (c.x - a.x) * (b.y - a.y) - (c.y - a.y) * (b.x - a.x) != 0;
}
int main() {
  scanf("%d", &n);
  for (int i = 1; i <= n; i++) scanf("%lld%lld", &p[i].x, &p[i].y), p[i].id = i;
  sort(p + 1, p + n + 1, cmp);
  for (int i = 3; i <= n; i++)
    if (check(p[1], p[2], p[i])) {
      printf("%d %d %d\n", p[1].id, p[2].id, p[i].id);
      break;
    }
  return 0;
}
