#include <bits/stdc++.h>
using namespace std;
typedef long long lint;
typedef pair<int, int> pi;
const int MAXN = 205;
const int mod = 998244353;

int n, pwr[MAXN];
pi a[MAXN];

int ccw(pi a, pi b, pi c){
	int dx1 = b.first - a.first;
	int dy1 = b.second - a.second;
	int dx2 = c.first - a.first;
	int dy2 = c.second - a.second;
	return dx1 * dy2 - dy1 * dx2;
}

int main(){
	int n; cin >> n;
	pwr[0] = 1;
	for(int i=0; i<n; i++){
		pwr[i+1] = pwr[i] * 2 % mod;
		cin >> a[i].first >> a[i].second;
	}
	sort(a, a + n);
	lint ret = 1;
	for(int i=0; i<n; i++){
		sort(a + i + 1, a + n, [&](const pi &p, const pi &q){
			return ccw(a[i], p, q) > 0;
		});
		ret += 1;
		for(int j=i+1; j<n; ){
			int e = j;
			while(e < n && ccw(a[i], a[j], a[e]) == 0) e++;
		//	printf("%d %d\n", j, e);
			ret += pwr[e - j] - 1;
			j = e;
		}
		sort(a + i + 1, a + n);
	}
	ret %= mod;
	ret = mod - ret + pwr[n];
	ret %= mod;
	cout << ret << endl;
}
