#include <bits/stdc++.h>
using namespace std;
const int maxn = 305;
int n, m;
class Point {
 public:
  long long x, y;
  Point() : x(0), y(0) {}
  Point(long long _x, long long _y) : x(_x), y(_y) {}
  void read() { scanf("%lld%lld", &x, &y); }
  Point operator+(const Point &o) const { return Point(x + o.x, y + o.y); }
  Point operator-(const Point &o) const { return Point(x - o.x, y - o.y); }
  long long operator*(const Point &o) const { return x * o.y - y * o.x; }
  bool operator<(const Point &o) const {
    int c = (y == 0 && x > 0) || (y > 0);
    int oc = (o.y == 0 && o.x > 0) || (o.y > 0);
    if (c != oc) return c > oc;
    return (*this) * o > 0;
  }
} p[maxn];
class Edge {
 public:
  Point w;
  int u, v;
  Edge() {}
  Edge(Point _w, int _u, int _v) : w(_w), u(_u), v(_v) {}
  bool operator<(const Edge &o) const { return w < o.w; }
} e[maxn * maxn];
long long dp[maxn][maxn][6];
int main() {
  scanf("%d", &n);
  for (int i = 0; i < n; i++) p[i].read();
  for (int i = 0; i < n; i++)
    for (int j = i + 1; j < n; j++) {
      e[m++] = Edge(p[j] - p[i], i, j);
      e[m++] = Edge(p[i] - p[j], j, i);
    }
  sort(e, e + m);
  for (int i = 0; i < n; i++) dp[i][i][0] = 1;
  for (int i = 0; i < m; i++)
    for (int j = 0; j < n; j++)
      for (int k = 0; k < 5; k++) dp[j][e[i].v][k + 1] += dp[j][e[i].u][k];
  long long ans = 0;
  for (int i = 0; i < n; i++) ans += dp[i][i][5];
  printf("%lld\n", ans);
  return 0;
}
