#include <bits/stdc++.h>
using namespace std;
int N;
signed long long X[3030], Y[3030];
signed long long tar[60600], tar2[60600];
signed long long star[60600], star2[60600];
signed long long sum[6060];
void solve() {
  int i, j, k, l, r, x, y;
  long double pi = atan((long double)1) * 4;
  cin >> N;
  for (i = 0; i < (N); i++) cin >> X[i] >> Y[i];
  signed long long ret = 0;
  for (i = 0; i < (N); i++) {
    vector<long double> V;
    for (j = 0; j < (N); j++)
      if (i != j) {
        long double a =
            atan2((long double)Y[j] - Y[i], (long double)X[j] - X[i]);
        V.push_back(a);
        V.push_back(2 * pi + a);
        V.push_back(4 * pi + a);
      }
    sort((V.begin()), (V.end()));
    int R = 0;
    for (j = 0; j < (2 * (N - 1)); j++) {
      while (V[R + 1] - V[j] <= pi) R++;
      tar[j] = R;
      tar2[j] = R * R;
      star[j] = tar[j];
      star2[j] = tar2[j];
      if (j) {
        star[j] += star[j - 1];
        star2[j] += star2[j - 1];
      }
    }
    for (j = 0; j < (N - 1); j++) {
      x = tar[j];
      ret += ((star2[x] - star2[j]) - 2 * tar[j] * (star[x] - star[j]) +
              (x - j) * tar2[j] - (star[x] - star[j]) + (x - j) * tar[j]) /
             2;
    }
  }
  cout << ret << endl;
}
int main(int argc, char** argv) {
  string s;
  int i;
  if (argc == 1) ios::sync_with_stdio(false), cin.tie(0);
  for (i = 0; i < (argc - 1); i++) s += argv[i + 1], s += '\n';
  for (i = 0; i < (s.size()); i++) ungetc(s[s.size() - 1 - i], stdin);
  cout.tie(0);
  solve();
  return 0;
}
