#include <bits/stdc++.h>

#define ll long long

#define big __int128

#define eps 1e-8

#define mod 998244353

using namespace std;

const int maxn = ;

int sgn(double x)

{

    if (fabs(x) < eps)

        return ;

    if (x < )

        return -;

    return ;

}

struct Point

{

    big x, y;

    Point() {}

    Point(big _x, big _y)

    {

        x = _x;

        y = _y;

    }

    Point operator+(const Point &b) const

    {

        return Point(x + b.x, y + b.y);

    }

    Point operator-(const Point &b) const

    {

        return Point(x - b.x, y - b.y);

    }

    big operator*(const Point &b) const

    {

        return x * b.x + y * b.y;

    }

    big operator^(const Point &b) const

    {

        return x * b.y - y * b.x;

    }

    void Mod()

    {

        bool tx = false, ty = false;

        if (x < )

        {

            x = -x;

            tx = true;

        }

        if (y < )

        {

            y = -y;

            ty = true;

        }

        x %= mod;

        y %= mod;

        if (tx)

            x = -x;

        if (ty)

            y = -y;

    }

    int getxx()

    {

        if (x >  && y >= )

            return ;

        if (x <=  && y > )

            return ;

        if (x <  && y <= )

            return ;

        if (x >=  && y < )

            return ;

        return ;

    }

} a[maxn],del[maxn];

bool cmp(Point &a,Point &b){

    if(a.getxx() != b.getxx()){

        return a.getxx() < b.getxx();

    }else{

        return (a^b)>;

    }

}

int n;

big ans;

void gao(int id){

    Point now = a[id];

    int m = ;

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

        if(i==id)continue;

        del[++m] = a[i]-now;

        //del[m].Mod();

    }

    if(m<=)return;

    sort(del+,del++m,cmp);

    int p1 = ,p2 = ;

    Point s1=del[],s2=del[],ts1,ts2;

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

        int nxt;

        while(true){

            nxt = p1+;

            if(nxt>m)nxt=;

            if(nxt==i)break;

            if(!((del[i]^del[nxt])>=&&(del[i]*del[nxt])>))break;

            if((del[i]^del[nxt])==&&(del[i]^del[p1])!=)break;

            p1=nxt;s1=s1+del[p1];

        }

        while(true){

            nxt = p2+;

            if(nxt>m)nxt=;

            if(nxt==i)break;

            if(!((del[i]^del[nxt])>=))break;

            if((del[i]^del[nxt])==&&(del[i]^del[p2])!=)break;

            p2=nxt;s2=s2+del[p2];

        }

        ts1=s1;ts2=s2-s1;ts1.Mod();ts2.Mod();

        ans+=(del[i]^ts1);ans %= mod;

        ans-=(del[i]^ts2)%mod*2ll%mod;

        ans=(ans+mod)%mod;

        if(p1==i){p1++;s1=s1+del[p1];}s1=s1-del[i];

        if(p2==i){p2++;s2=s2+del[p2];}s2=s2-del[i];

    }

}

int main()

{

    int T;

    scanf("%d",&T);

    big inv = (mod+)/;

    while (T--)

    {

        scanf("%d",&n);

        ans=;

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

        {

            ll x, y;

            scanf("%lld%lld",&x,&y);

            a[i] = Point(x, y);

        }

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

            gao(i);

        }

        ans=(ans*inv)%mod;

        ll t = ans;

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

    }

    return ;

}