#include<iostream>
#include<cstdio>
#include<cstring>
#include<cmath>
#include<algorithm>
using namespace std;
const int mod=998244353;
int n;
int x[205],y[205],p[205];
int main()
{
    scanf("%d",&n);
    for(int i=1;i<=n;i++)
        scanf("%d%d",&x[i],&y[i]);
    p[0]=1;
    for(int i=1;i<=n;i++)
        p[i]=(p[i-1]*2)%mod;
    int ans=p[n]-n-1;
    for(int i=1;i<=n;i++)
	{
        for(int j=1;j<i;j++)
		{
            int cnt=0;
            for(int k=1;k<j;k++)
			{
                if((x[i]-x[j])*(y[i]-y[k])==(x[i]-x[k])*(y[i]-y[j]))
                    cnt++;
            }
            ans=(ans-p[cnt]+mod)%mod;
        }
    }
    printf("%d\n",ans);
    return 0;
}