import std.conv, std.functional, std.range, std.stdio, std.string;
import std.algorithm, std.array, std.bigint, std.bitmanip, std.complex, std.container, std.math, std.mathspecial, std.numeric, std.regex, std.typecons;
import core.bitop;

class EOFException : Throwable { this() { super("EOF"); } }
string[] tokens;
string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; }
int readInt() { return readToken.to!int; }
long readLong() { return readToken.to!long; }
real readReal() { return readToken.to!real; }

bool chmin(T)(ref T t, in T f) { if (t > f) { t = f; return true; } else { return false; } }
bool chmax(T)(ref T t, in T f) { if (t < f) { t = f; return true; } else { return false; } }

int binarySearch(alias pred, T)(in T[] as) { int lo = -1, hi = cast(int)(as.length); for (; lo + 1 < hi; ) { const mid = (lo + hi) >> 1; (unaryFun!pred(as[mid]) ? hi : lo) = mid; } return hi; }
int lowerBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a >= val)); }
int upperBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a > val)); }




void main() {
  try {
    for (; ; ) {
      const N = readInt();
      auto X = new long[N];
      auto Y = new long[N];
      foreach (i; 0 .. N) {
        X[i] = readLong();
        Y[i] = readLong();
      }
      
      long ans;
      long n;
      foreach (i; 0 .. N) {
        if (!(X[i] == 0 && Y[i] == 0)) {
          ++n;
          long cnt, cnt0, cnt1;
          foreach (j; 0 .. N) {
            const det = X[i] * Y[j] - Y[i] * X[j];
            const dot = X[i] * X[j] + Y[i] * Y[j];
            if (det == 0) {
              if (dot > 0) {
                if (i < j) {
                  ++cnt;
                  ++cnt0;
                }
              } else if (dot < 0) {
                ++cnt;
                ++cnt1;
              }
            } else {
              if (det > 0) {
                ++cnt;
              }
            }
          }
          debug {
            writeln(i, ": ", cnt);
          }
          ans += cnt * (cnt - 1) / 2;
          ans -= cnt0 * cnt1;
        }
      }
      ans = n * (n - 1) * (n - 2) / 6 - ans;
      writeln(ans);
    }
  } catch (EOFException e) {
  }
}