#include <bits/stdc++.h>
using namespace std;
int n;
pair<pair<int, int>, int> a[112345];
int main() {
  scanf("%d", &n);
  long long int x, y, x2, y2, x3, y3, k, t;
  for (int i = 0; i < n; i++) {
    scanf("%d%d", &x, &y);
    a[i].first.first = x;
    a[i].first.second = y;
    a[i].second = i + 1;
  }
  sort(a, a + n);
  x = a[0].first.first;
  y = a[0].first.second;
  x2 = a[1].first.first;
  y2 = a[1].first.second;
  k = 2;
  x3 = a[k].first.first;
  y3 = a[k].first.second;
  while ((y - y2) * (x3 - x2) == (x - x2) * (y3 - y2)) {
    k++;
    x3 = a[k].first.first;
    y3 = a[k].first.second;
  }
  printf("%d %d %d\n", a[0].second, a[1].second, a[k].second);
  return 0;
}
