#include <bits/stdc++.h>
#define N 210
#define ll long long
#define db double
#define For(i,x,y) for(int i=(x);i<=(y);++i)
#define Rof(i,x,y) for(int i=(x);i>=(y);--i)
#define Edge(x) for(int i=head[x];i;i=e[i].nxt)
#define lson l,mid,o<<1
#define rson mid+1,r,o<<1|1
#define mset(x,y) memset(x,y,sizeof(y))
#define mcpy(x,y) memcpy(x,y,sizeof(x))
#define p_b push_back
#define mod 998244353
using namespace std;
ll _2[N];
int x[N],y[N];
int main(){
	int n;
	scanf("%d",&n);_2[0]=1;
	For(i,1,n) _2[i]=(_2[i-1]+_2[i-1])%mod;
	ll ans=_2[n]-1-n-n*(n-1)/2;
	while(ans<0) ans+=mod;
	For(i,1,n) scanf("%d%d",&x[i],&y[i]);
	For(i,1,n) For(j,i+1,n){
		int tmp=0;
		For(k,j+1,n) if(1ll*(1ll*y[j]-y[i])*(1ll*x[k]-x[j])==1ll*(1ll*y[k]-y[j])*(1ll*x[j]-x[i])) tmp++;
		(ans+=mod+1-_2[tmp])%=mod;
	}
	printf("%lld\n",ans);
}
