#include <bits/stdc++.h>
using namespace std;
const int maxn = 2 * 1e3 + 5;
const int mod = 1000000007;
const int inf = 1e9 + 10;
const long long INF = 1e18;
int n;
map<pair<int, int>, int> mp;
pair<int, int> points[maxn];
int primes[505];
int nprimes;
bool is_prime[505];
void sieve(int n) {
  for (int i = 2; i <= n; ++i) is_prime[i] = true;
  for (int i = 2; i <= n; ++i) {
    if (is_prime[i]) {
      primes[nprimes++] = i;
      for (int j = i * 2; j <= n; j += i) is_prime[j] = false;
    }
  }
}
void deduce(int &x, int &y) {
  for (int i = 0; i < nprimes; ++i) {
    int t = primes[i];
    while (x % t == 0 && y % t == 0) {
      x /= t, y /= t;
    }
  }
}
int MAIN() {
  scanf("%d", &n);
  sieve(500);
  for (int i = 0; i < n; ++i)
    scanf("%d%d", &points[i].first, &points[i].second);
  long long tot = 0;
  for (int i = 0; i < n; ++i) {
    mp.clear();
    for (int j = 0; j < n; ++j) {
      if (j == i) continue;
      int x = points[j].first - points[i].first;
      int y = points[j].second - points[i].second;
      if (x == 0) {
        y = 1;
      } else if (y == 0) {
        x = 1;
      } else if (x < 0) {
        x = -x;
        y = -y;
      }
      deduce(x, y);
      pair<int, int> dummy = make_pair(x, y);
      if (!mp.count(dummy))
        mp[dummy] = 1;
      else
        ++mp[dummy];
    }
    long long sm = 0;
    for (map<pair<int, int>, int>::iterator it = mp.begin(); it != mp.end();
         ++it) {
      sm += it->second;
    }
    for (map<pair<int, int>, int>::iterator it = mp.begin(); it != mp.end();
         ++it) {
      sm -= it->second;
      tot += (sm * it->second);
    }
  }
  tot /= 3;
  printf("%I64d\n", tot);
  return 0;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL), cout.tie(NULL);
  cout << fixed << setprecision(16);
  int ret = MAIN();
  return ret;
}
