#include <cstdio>

const int maxn = 233, mod = 998244353;

int n, ans, x[maxn], y[maxn], pw2[maxn];

int main() {
	scanf("%d", &n);
	pw2[0] = 1;
	for (int i = 1; i <= n; ++i) {
		pw2[i] = (pw2[i - 1] << 1) % mod;
	}
	for (int i = 0; i < n; ++i) {
		scanf("%d%d", x + i, y + i);
		for (int j = 0; j < i; ++j) {
			int m = 0;
			for (int k = 0; k < j; ++k) {
				if((x[j] - x[k]) * (y[i] - y[k]) == (x[i] - x[k]) * (y[j] - y[k])) {
					++m;
				}
			}
			ans = (ans + pw2[m]) % mod;
		}
	}
	printf("%d\n", (pw2[n] - ans - n - 1 + mod) % mod);
	return 0;
}
