#include <bits/stdc++.h>
inline long long gcd(long long a, long long b) { return b ? gcd(b, a % b) : a; }
inline void sub(long long &a, long long b) {
  a -= b;
  if (a < 0) a += 998244353;
}
inline void add(long long &a, long long b) {
  a += b;
  if (a >= 998244353) a -= 998244353;
}
template <typename T>
inline T const &MAX(T const &a, T const &b) {
  return a > b ? a : b;
}
template <typename T>
inline T const &MIN(T const &a, T const &b) {
  return a < b ? a : b;
}
inline long long qp(long long a, long long b) {
  long long ans = 1;
  while (b) {
    if (b & 1) ans = ans * a % 998244353;
    a = a * a % 998244353, b >>= 1;
  }
  return ans;
}
inline long long qp(long long a, long long b, long long c) {
  long long ans = 1;
  while (b) {
    if (b & 1) ans = ans * a % c;
    a = a * a % c, b >>= 1;
  }
  return ans;
}
using namespace std;
const unsigned long long ba = 233;
const double eps = 1e-5;
const long long INF = 0x3f3f3f3f3f3f3f3f;
const int N = 300000 + 10, maxn = 1000000 + 10, inf = 0x3f3f3f3f;
struct point {
  long long x, y;
  int id;
  void read() { scanf("%lld%lld", &x, &y); }
} p[N];
int n;
long long dir(point p1, point p2, point p3) {
  return (p3.x - p2.x) * (p2.y - p1.y) - (p3.y - p2.y) * (p2.x - p1.x);
}
long long dis(point a, point b) {
  return (a.x - b.x) * (a.x - b.x) + (a.y - b.y) * (a.y - b.y);
}
long long area(point p1, point p2, point p3) { return fabs(dir(p1, p2, p3)); }
bool cmp(point a, point b) {
  long long te = dir(p[0], a, b);
  if (te < 0) return 1;
  if (te == 0 && dis(p[0], a) < dis(p[0], b)) return 1;
  return 0;
}
int main() {
  scanf("%d", &n);
  for (int i = 0; i < n; i++) p[i].read(), p[i].id = i + 1;
  long long pos, minx, miny;
  minx = miny = INF;
  for (int i = 0; i < n; i++) {
    if (p[i].x < minx || (p[i].x == minx && p[i].y < miny)) {
      minx = p[i].x;
      miny = p[i].y;
      pos = i;
    }
  }
  swap(p[0], p[pos]);
  sort(p + 1, p + n, cmp);
  for (int i = 2; i < n; i++)
    if (dir(p[0], p[1], p[i]) != 0) {
      printf("%d %d %d\n", p[0].id, p[1].id, p[i].id);
      return 0;
    }
  return 0;
}
