#pragma GCC optimize(2)

#pragma GCC optimize(3)

#pragma GCC optimize(4)

#include<bits/stdc++.h>

using namespace std;

#define fi first

#define se second

#define pi acos(-(long double)1.0)

#define LL long long

//#define mp make_pair

#define pb push_back

#define ls rt<<1, l, m

#define rs rt<<1|1, m+1, r

#define ULL unsigned LL

#define pll pair<LL, LL>

#define pli pair<LL, int>

#define pii pair<int, int>

#define piii pair<pii, int>

#define pdd pair<long double, long double>

#define mem(a, b) memset(a, b, sizeof(a))

#define fio ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);

#define fopen freopen("in.txt", "r", stdin);freopen("out.txt", "w", stout);

//head

const int N = 2e3 + ;

struct point {

    LL x, y;

    point(){}

    point(LL x, LL y):x(x), y(y){}

    LL dot(point p) {

        return x*p.x + y*p.y;

    }

    LL cross(point p) {

        return x*p.y - y*p.x;

    }

}p[N], t[N];

bool anglecmp(point a, point b) {

    if(a.y <=  && b.y > ) return true;

    if(a.y >  && b.y <= ) return false;

    if(!a.y && !b.y) return a.x < b.x;

    return a.cross(b) > ;

}

bool acute(point a, point b) {

    return a.dot(b) >  && a.cross(b) >= ;

}

bool acute2(point a, point b) {

    return a.dot(b) >  && a.cross(b) < ;

}

int main() {

    int T, n;

    scanf("%d", &T);

    while(T--) {

        scanf("%d", &n);

        for (int i = ; i <= n; i++) scanf("%lld %lld", &p[i].x, &p[i].y);

        LL ans = 1LL*n*(n-)*(n-)/;

        for (int i = ; i <= n; i++) {

            int cnt = ;

            for (int j = ; j <= n; j++) {

                if(j!=i)

                    t[++cnt] = point(p[j].x - p[i].x, p[j].y - p[i].y);

            }

            sort(t+, t++cnt, anglecmp);

            int l = , r = ;

            for (int j = ; j <= cnt; j++) {

                while(l <= cnt && acute(t[j], t[l])) l++;

                while(r <= cnt && !acute2(t[j], t[r])) r++;

                ans -= r-l;

            }

        }

        printf("%lld\n", ans);

    }

    return ;

}