#include<bits/stdc++.h>
using namespace std;
const int N=205,M=998244353;
int n,ans,x[N],y[N],fac[N];
int main(){
	scanf("%d",&n);
	fac[0]=1;
	for (int i=1;i<=n;i++)fac[i]=fac[i-1]*2%M;
	for (int i=1;i<=n;i++)scanf("%d%d",&x[i],&y[i]);
	ans=(fac[n]-n-1-n*(n-1)/2+M)%M;
	for (int i=1;i<=n;i++)
		for (int j=i+1;j<=n;j++){
			int num=0;
			for (int k=j+1;k<=n;k++)
				if ((y[j]-y[i])*(x[k]-x[j])==(y[k]-y[j])*(x[j]-x[i]))num++;
			(ans+=M+1-fac[num])%=M;
		}
	printf("%d",ans);
	return 0;
}
