#include <bits/stdc++.h>
using namespace std;
struct point {
  int x, y;
};
bool compare(point a, point b) {
  if (a.x < b.x)
    return 1;
  else if (a.x == b.x && a.y < b.y)
    return 1;
  return 0;
}
bool orient(point p1, point p2, point p3) {
  long long xx = ((long long)(p3.y - p2.y)) * (p2.x - p1.x) -
                 ((long long)(p2.y - p1.y)) * (p3.x - p2.x);
  if (xx == 0) return 0;
  return 1;
}
int main() {
  int i, j, t;
  int n;
  map<pair<int, int>, int> mapp;
  point arr[100005];
  cin >> n;
  for (i = 0; i < n; i++) {
    cin >> arr[i].x >> arr[i].y;
    mapp[make_pair(arr[i].x, arr[i].y)] = i + 1;
  }
  sort(arr, arr + n, compare);
  for (i = 0; i < n - 2; i++) {
    point first = arr[i];
    point second = arr[i + 1];
    point third = arr[i + 2];
    if (orient(first, second, third)) {
      printf("%d %d %d\n", mapp[make_pair(first.x, first.y)],
             mapp[make_pair(second.x, second.y)],
             mapp[make_pair(third.x, third.y)]);
      return 0;
    }
  }
  return 0;
}
