#include<iostream>
#include<algorithm>
#include<string.h>
#include<stdio.h>
#include<queue>
#define x first
#define y second
using namespace std;
const int mod=998244353;
int N;

int x[205],y[205],power[205];

int main()
{
	scanf("%d",&N);
	for(int i=0;i<N;i++)
	{
		scanf("%d %d",&x[i],&y[i]);
	}
	int ans;
	power[0]=1;
	for(int i=0;i<N;i++)
	{
		power[i+1]=(power[i]<<1)%mod;
	}
	ans=power[N]-N-1;

	for(int i=0;i<N;i++)
	for(int j=0;j<i;j++)
	{
		int cnt=0;
		for(int k=0;k<j;k++)
		{
			if((x[i]-x[j])*(y[i]-y[k])==(x[i]-x[k])*(y[i]-y[j]))
			cnt++;
		}
		ans=(ans-power[cnt]+mod)%mod;
	}
		printf("%d\n",ans);
}