#include <bits/stdc++.h>

const int N=210,Mod=998244353;

struct Point{
	int x,y;
	Point(int x=0,int y=0):x(x),y(y) {}
	Point operator - ( const Point &A ) const { return Point(x-A.x,y-A.y); }
	Point operator / ( const int &p ) const { return Point(x/p,y/p); }
	bool operator == ( const Point &A ) const { return x==A.x && y==A.y; }
	bool operator < ( const Point &A ) const { return x<A.x || ( x==A.x && y<A.y); }
}p[N],q[N];
typedef Point Vector;

int n,qp2[N];

void Init() {
	scanf("%d",&n);
	for (int i=1;i<=n;++i) scanf("%d%d",&p[i].x,&p[i].y);
}

int gcd(int a,int b) { return (!b)?a:gcd(b,a%b); }

Vector C(const Vector &a) { return a/gcd(a.x,a.y); }

void Solve() {
	int ans=1; 
	qp2[0]=1; for (int i=1;i<=n;++i) qp2[i]=(qp2[i-1]<<1)%Mod,ans=(ans<<1)%Mod;
	ans--; ans-=n;
	std::sort(p+1,p+n+1);
	for (int i=1;i<=n;++i) {
		int t=0;
		for (int j=i+1;j<=n;++j) 
			q[++t]=C(p[j]-p[i]);
		std::sort(q+1,q+t+1);
		for (int h=1;h<=t;) {
			int p=h; while (q[p]==q[h] && h<=t) ++h;
			ans=(0ll+ans-(qp2[h-p]-1)+Mod)%Mod;
		}
	}
	printf("%d\n",ans);
}

int main() {
	Init();
	Solve();
	return 0;
}