#include <bits/stdc++.h>
using namespace std;
const int mod = 1e9 + 7;
struct fastio {
  char s[100000];
  int it, len;
  fastio() { it = len = 0; }
  inline char get() {
    if (it < len) return s[it++];
    it = 0;
    len = fread(s, 1, 100000, stdin);
    if (len == 0)
      return EOF;
    else
      return s[it++];
  }
  bool notend() {
    char c = get();
    while (c == ' ' || c == '\n') c = get();
    if (it > 0) it--;
    return c != EOF;
  }
} _buff;
inline long long getnum() {
  long long r = 0;
  bool ng = 0;
  char c;
  c = _buff.get();
  while (c != '-' && (c < '0' || c > '9')) c = _buff.get();
  if (c == '-') ng = 1, c = _buff.get();
  while (c >= '0' && c <= '9') r = r * 10 + c - '0', c = _buff.get();
  return ng ? -r : r;
}
template <class T>
inline void putnum(T x) {
  if (x < 0) putchar('-'), x = -x;
  register short a[20] = {}, sz = 0;
  while (x) a[sz++] = x % 10, x /= 10;
  if (sz == 0) putchar('0');
  for (int i = sz - 1; i >= 0; i--) putchar('0' + a[i]);
}
inline char getreal() {
  char c = _buff.get();
  while (c <= 32) c = _buff.get();
  return c;
}
long long qpow(long long x, long long k) {
  return k == 0 ? 1
                : 1ll * qpow(1ll * x * x % mod, k >> 1) * (k & 1 ? x : 1) % mod;
}
int n;
int px[311], py[311];
long long dp[311][6];
int main() {
  n = getnum();
  for (int i = 1; i <= n; i++) px[i] = getnum(), py[i] = getnum();
  vector<pair<double, pair<int, int> > > v;
  for (int i = 1; i <= n; i++)
    for (int j = 1; j <= n; j++) {
      if (i == j) continue;
      v.push_back(
          make_pair(atan2(py[j] - py[i], px[j] - px[i]), make_pair(i, j)));
    }
  sort(v.begin(), v.end());
  long long ans = 0;
  for (int i = 1; i <= n; i++) {
    memset(dp, 0, sizeof(dp));
    dp[i][0] = 1;
    for (auto x : v)
      for (int t = 0; t < 5; t++)
        dp[x.second.second][t + 1] += dp[x.second.first][t];
    ans += dp[i][5];
  }
  cout << ans << endl;
  return 0;
}
