#include<iostream>
#include<stdio.h>
#include<string.h>
#include<algorithm>
#define maxn 205
using namespace std;
typedef long long ll;
const ll mod=998244353;
int n;
int x[maxn],y[maxn];
ll mypow[maxn];
int main()
{
	scanf("%d",&n);

	mypow[0]=1;
	for(int i=1;i<=n;i++)
		scanf("%d%d",&x[i],&y[i]),mypow[i]=(mypow[i-1]<<1)%mod;

	ll ans=(mypow[n]-n-1+mod)%mod;

	for(int i=1;i<=n;i++)
	{
		for(int j=i+1;j<=n;j++)
		{
			int cnt=0;
			for(int k=j+1;k<=n;k++)
			{
				if((x[i]-x[j])*(y[i]-y[k])==(x[i]-x[k])*(y[i]-y[j]))
					cnt++;
			}
			ans=(ans-mypow[cnt]+mod)%mod;
		}
	}

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