#include <cstdio>

#include <cstring>

#include <algorithm>

#include <iostream>

#include <cmath>

using namespace std;

const double pi = acos(-1.0);

#define ll long long

#define maxn 1010

#define mod 998244353

int area2(int ax, int ay, int bx, int by){

	return ((1ll*ax*by%mod-1ll*ay*bx%mod)%mod+mod)%mod;

}

struct Pnt{

	int x,y;

	double ang;

	bool operator < (const Pnt &b) const{

		return ang < b.ang;

	}

}vec[maxn<<1];

int p2[maxn];

int main(){

	p2[0]=1;

	for(int i=1;i<=1000;++i) p2[i] = (p2[i-1]<<1)%mod;

	int t;

	scanf("%d",&t);

	while(t--){

		int n;

		scanf("%d",&n);

		int x[maxn],y[maxn];

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

			scanf("%d%d",x+i,y+i);

		}

		int ans = 0;

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

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

				vec[j].x = x[j];

				vec[j].y = y[j];

				vec[j].ang = atan2(x[j]-x[i],y[j]-y[i]);

			}

			vec[i] = vec[n-1];

			for(int j=0;j<n-1;++j){

				vec[j+n-1] = vec[j];

				vec[j+n-1].ang += pi*2;

			}

			int nn = n-1+n-1;

			sort(vec,vec+nn);

			int l=0,r=0;

			while(l<n-1){

				while(r<nn && vec[r].ang - vec[l].ang < pi) r++;

				int area = area2(x[i],y[i],vec[l].x,vec[l].y);

				int cnt = (p2[r-l-1]-1+mod)%mod;

				ans = (ans+1ll*area*cnt%mod)%mod;

				++l;

			}

		}

		printf("%d\n",(mod-ans)%mod);

	}

	return 0;

}