#include <bits/stdc++.h>
using namespace std;
struct P {
  long long i, x, y;
} p[100005];
bool compare(P a, P b) {
  if (a.x != b.x) return a.x < b.x;
  return a.y < b.y;
}
bool linear(P p1, P p2, P p3) {
  if (p1.x * p2.y + p3.x * p1.y + p2.x * p3.y - p3.x * p2.y - p2.x * p1.y -
          p1.x * p3.y !=
      0)
    return false;
  return true;
}
int main() {
  ios::sync_with_stdio(false);
  int n;
  cin >> n;
  for (int i = 0; i < n; i++) {
    cin >> p[i].x >> p[i].y;
    p[i].i = i + 1;
  }
  sort(p, p + n, compare);
  for (int i = 0; i < n - 2; i++) {
    if (!linear(p[i], p[i + 1], p[i + 2])) {
      cout << p[i].i << " " << p[i + 1].i << " " << p[i + 2].i << endl;
      return 0;
    }
  }
}
