#include<iostream>
#include<cstdio>
 
using namespace std;
 
const long long p=998244353ll;
long long b[201],ans;
int n,x[201],y[201];
 
int main(){
    scanf("%d",&n);for(int i=1;i<=n;++i)scanf("%d%d",x+i,y+i);
    for(int i=b[0]=1;i<=n;++i)b[i]=b[i-1]*2ll%p;
    ans=b[n]-(n*(n+1ll)>>1)%p-1ll;
    for(int i=1;i<=n;++i){
        for(int j=i+1;j<=n;++j){
            int cnt=0ll;
            for(int k=j+1;k<=n;++k)cnt+=(x[j]-x[i])*(y[k]-y[j])==(x[k]-x[j])*(y[j]-y[i]);
            (ans-=b[cnt]-1ll)%=p;
        }
    }
    printf("%lld",ans<0ll?ans+p:ans);
}