#include <bits/stdc++.h>
using namespace std;
struct P {
  int x, y;
  P() {}
  P(int _x, int _y) : x(_x), y(_y) {}
  P operator+(const P& a) const { return P(x + a.x, y + a.y); }
  P operator-(const P& a) const { return P(x - a.x, y - a.y); }
  long long dot(const P& a) const {
    return (long long)x * a.x + (long long)y * a.y;
  }
  long long crs(const P& a) const {
    return (long long)x * a.y - (long long)y * a.x;
  }
  P rot90() const { return P(-y, x); }
  bool operator<(const P& a) const { return x < a.x || x == a.x && y < a.y; }
  bool upper() const { return y > 0 || y == 0 && x > 0; }
  void get() {
    cin >> x;
    cin >> y;
  }
  void out() { printf("%d %d\n", x, y); }
};
int n;
P a[310];
bitset<310> b[310][310];
int s[310];
int main() {
  cin >> n;
  for (int i = 0; i < n; i++) a[i].get();
  for (int i = 0; i < n; i++)
    for (int j = 0; j < n; j++)
      for (int k = 0; k < n; k++)
        if ((a[j] - a[i]).crs(a[k] - a[i]) > 0) b[i][j][k] = 1;
  for (int i = 0; i < n; i++)
    for (int j = 0; j < n; j++)
      for (int k = 0; k < n; k++)
        if ((a[j] - a[i]).crs(a[k] - a[i]) > 0) {
          s[(b[i][j] & b[j][k] & b[k][i]).count()]++;
        }
  for (int i = 0; i < n; i++) s[i] /= 3;
  long long S = (long long)n * (n - 1) * (n - 2) * (n - 3) * (n - 4) / 120;
  long long T = 0;
  for (int i = 0; i < n; i++) T += (long long)s[i] * i * (n - 4);
  S -= T / 2;
  for (int i = 0; i < n; i++) S += (long long)s[i] * i * (i - 1) / 2;
  cout << S << endl;
  return 0;
}
