#include <bits/stdc++.h>
using namespace std;
const double eps = 1e-9;
const int inf = INT_MAX;
const int N = 100004;
const int modn = 1000000007;
complex<long long> v[N];
int p[N];
long long x(complex<long long> a) { return a.real(); }
long long y(complex<long long> a) { return a.imag(); }
long long cross(complex<long long> a, complex<long long> b) {
  return y(conj(a) * b);
}
int n;
bool comp(int i, int j) {
  if (x(v[i]) == x(v[j])) return y(v[i]) < y(v[j]);
  return x(v[i]) < x(v[j]);
}
int sig(long long x) { return (x > 0) - (x < 0); }
int ok(complex<long long> a, complex<long long> b, complex<long long> c) {
  return sig(cross(b - a, c - a));
}
int main() {
  scanf("%d", &n);
  long long a, b;
  for (int i = 0; i < n; i++) {
    p[i] = i;
    cin >> a >> b;
    v[i] = complex<long long>(a, b);
  }
  int cont = 0;
  sort(p, p + n, comp);
  for (int i = 0; i < n - 2; i++) {
    if (ok(v[p[i]], v[p[i + 1]], v[p[i + 2]])) {
      printf("%d %d %d\n", p[i] + 1, p[i + 1] + 1, p[i + 2] + 1);
      return 0;
    }
  }
}
