#include<iostream>
#include<algorithm>
#include<cstdio>
#include<cstring>
using namespace std;
const int mod=998244353;
int x[2005],y[2005],tw[2100],n,num,ans;
int main()
{
	cin>>n;
	for(int i=1;i<=n;i++)
		cin>>x[i]>>y[i];
	tw[0]=1;
	for(int i=1;i<=2000;i++)
		tw[i]=(tw[i-1]<<1)%mod;
	ans=tw[n]-n-1;
	//cout<<tw[n]<<endl;
	for(int i=1;i<=n;i++)
		for(int j=i+1;j<=n;j++)
		{
			num=0;
			for(int k=j+1;k<=n;k++)
				if((x[j]-x[i])*(y[k]-y[j])==(x[k]-x[j])*(y[j]-y[i]))
					num++;
			ans=(ans-tw[num]+mod)%mod;
		//	cout<<i<<" "<<j<<" "<<ans<<endl;
		}
	//ans-=(n+1);
	cout<<ans<<endl;
}