#include <bits/stdc++.h>
using namespace std;
int dx[] = {0, 0, +1, -1};
int dy[] = {+1, -1, 0, 0};
int dxx[] = {+1, 0, -1, 0, +1, +1, -1, -1};
int dyy[] = {0, +1, 0, -1, +1, -1, +1, -1};
inline bool EQ(double a, double b) { return fabs(a - b) < 1e-9; }
pair<pair<int, int>, int> p[100007];
bool func(long long x1, long long y1, long long x2, long long y2, long long x3,
          long long y3) {
  return ((x1 * (y2 - y3) - y1 * (x2 - x3) + (x2 * y3 - y2 * x3)) == 0);
}
int main() {
  int n, i, j, k;
  scanf("%d", &n);
  for (i = 0; i < n; i++) {
    scanf("%d %d", &p[i].first.first, &p[i].first.second);
    p[i].second = i;
  }
  sort(p, p + n);
  for (i = 0; i < n - 2; i++) {
    j = i + 1;
    k = i + 2;
    if (func(p[i].first.first, p[i].first.second, p[j].first.first,
             p[j].first.second, p[k].first.first, p[k].first.second))
      continue;
    printf("%d %d %d\n", p[i].second + 1, p[j].second + 1, p[k].second + 1);
    break;
  }
  return 0;
}
