#include <bits/stdc++.h>
using namespace std;
struct node {
  long long x, y, id;
} a[100005];
long long n;
bool cmp(node a, node b) {
  if (a.x < b.x) return 1;
  if (a.x > b.x) return 0;
  return a.y < b.y;
}
bool coline(long long x1, long long x2, long long x3) {
  long long dx1 = a[x1].x - a[x2].x, dx2 = a[x1].x - a[x3].x;
  long long dy1 = a[x1].y - a[x2].y, dy2 = a[x1].y - a[x3].y;
  return dx1 * dy2 - dx2 * dy1 == 0;
}
int main() {
  ios::sync_with_stdio(false);
  cin >> n;
  for (long long i = 0; i < n; ++i) {
    cin >> a[i].x >> a[i].y;
    a[i].id = i + 1;
  }
  sort(a, a + n, cmp);
  for (long long i = 0; i + 2 < n; ++i) {
    if (coline(i, i + 1, i + 2)) continue;
    cout << a[i].id << ' ' << a[i + 1].id << ' ' << a[i + 2].id << endl;
    return 0;
  }
}
