#include <bits/stdc++.h>
using namespace std;
const int BINF = 9e18, LINF = 2e9, mod = 1e9 + 7, P = 179, Q = 1791791791;
const int MAXN = 2000;
int first[MAXN];
int second[MAXN];
int cnt[MAXN][MAXN];
int gcd(int a, int b) { return b ? gcd(b, a % b) : a; }
inline bool is(int first, int second) {
  return (first + 200 > 0 && second + 200 > 0 && first + 200 < MAXN &&
          second + 200 < MAXN && cnt[first + 200][second + 200]);
}
void solve() {
  int n;
  cin >> n;
  for (int i = 0; i < n; ++i) {
    cin >> first[i] >> second[i];
    cnt[first[i] + 200][second[i] + 200]++;
  }
  long long ans = 0;
  for (int i = 0; i < n; ++i)
    for (int j = i + 1; j < n; ++j) {
      int dx = first[i] - first[j];
      int dy = second[i] - second[j];
      int g = gcd(abs(dx), abs(dy));
      dx /= g;
      dy /= g;
      int sum = 0;
      for (int d = -202; d < 202; ++d) {
        int nx = first[i] + dx * d;
        int ny = second[i] + dy * d;
        if (is(nx, ny)) sum++;
      }
      sum -= 2;
      ans += sum;
    }
  cout << (long long)n * (long long)(n - 1) * (long long)(n - 2) / 6 - ans / 3;
}
signed main() {
  ios_base::sync_with_stdio(false);
  cout.precision(40);
  solve();
  return 0;
}
