#include<bits/stdc++.h>
using namespace std;

const int N=100100,mod=998244353;
int x[N],y[N],pw[N],n,ans;

int main(){
	ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
	cin>>n;
	pw[0]=1;
	for(int i=1;i<=n;++i)pw[i]=pw[i-1]*2%mod;
	for(int i=1;i<=n;++i)cin>>x[i]>>y[i];
	ans=(pw[n]-1+mod-n)%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((y[k]-y[j])*(x[k]-x[i])==(y[k]-y[i])*(x[k]-x[j]))++cnt;
			ans=(ans-pw[cnt]+mod)%mod;
		}
	cout<<ans<<'\n';
	return 0;
}
