#include <bits/stdc++.h>
using namespace std;
int main() {
  int n;
  cin >> n;
  long long int x[n], y[n];
  vector<pair<long long int, long long int>> v;
  for (int i = 0; i < n; i++) {
    cin >> x[i] >> y[i];
    v.push_back(make_pair(x[i], y[i]));
  }
  sort(v.begin(), v.end());
  vector<int> vv;
  for (int i = 0; i < n; i++) {
    if (x[i] == v[0].first && y[i] == v[0].second && vv.size() <= 1) {
      vv.push_back(i + 1);
      break;
    }
  }
  for (int i = 0; i < n; i++) {
    if (x[i] == v[1].first && y[i] == v[1].second) {
      vv.push_back(i + 1);
      break;
    }
  }
  int j;
  for (int i = 2; i < n; i++) {
    if (((v[1].second - v[0].second) * (v[1].first - v[i].first)) !=
        ((v[1].second - v[i].second) * (v[1].first - v[0].first))) {
      j = i;
      break;
    }
  }
  for (int i = 0; i < n; i++) {
    if (x[i] == v[j].first && y[i] == v[j].second) {
      vv.push_back(i + 1);
      break;
    }
  }
  cout << vv[0] << " " << vv[1] << " " << vv[2];
  return 0;
}
