#include<bits/stdc++.h>
using namespace std;
#define int long long
inline int read(){
	int x=0,f=0;
	char ch=getchar();
	for (;ch<'0'||ch>'9';ch=getchar()) f^=(ch=='-');
	for (;ch>='0'&&ch<='9';ch=getchar()) x=x*10+ch-'0';
	return f ? -x : x;
}
const int P=998244353,maxn=1010;
inline int kasumi(int x,int y) {
	int qwq=1;
	while (y) {
		if (y&1) qwq=qwq*x%P;
		y>>=1;
		x=x*x%P;
	}
	return qwq;
}
int x[maxn],y[maxn],n,ans;
signed main(){
	n=read();
	for (int i=1;i<=n;++i) {
		x[i]=read();y[i]=read();
	} 
	ans=(kasumi(2,n)-n-1-n*(n-1)/2+P)%P;
	for (int i=1;i<=n;++i) {
		for (int j=i+1;j<=n;++j) {
			int qwq=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])) ++qwq;
			}
			ans=(ans-kasumi(2,qwq)+P+1)%P;
		}
	}
	printf("%lld\n",ans);
	return 0;
}