#include <bits/stdc++.h>
using namespace std;
using i64 = long long;
constexpr int N = 210, M = 40010, mod = 998244353;
int n, m, cnt, ok[N][N], id[N], tmp[N];
int ans;
struct Point {
	i64 x, y;
	Point(i64 _x = 0, i64 _y = 0) : x(_x), y(_y) {}
	friend istream& operator >> (istream &in, Point &x) {
		in >> x.x >> x.y;
		return in;
	}
	friend ostream& operator << (ostream &out, Point x) {
		out << '(' << x.x << ',' << x.y << ')';
		return out;
	}
	friend Point operator - (Point x, Point y) {
		return Point(x.x - y.x, x.y - y.y);
	}
	friend bool operator < (Point x, Point y) {
		return x.y == y.y ? x.x < y.x : x.y < y.y;
	}
	Point rot() {
		return Point(-y, x);
	}
	int sgn() {
		return y > 0 || y == 0 && x > 0;
	}
}a[N];
i64 cross(Point x, Point y) {
	return x.x * y.y - x.y * y.x;
}
i64 dot(Point x, Point y) {
	return x.x * y.x + x.y * y.y;
}
int sgn(i64 x) {return (x > 0) - (x < 0);}
struct Line {
	int s, t;
	Point v;
	friend bool operator < (Line x, Line y) {
		int dx = x.v.sgn(), dy = y.v.sgn();
		if(dx != dy) return dx > dy;
		i64 cmp = cross(x.v, y.v);
		return cmp ? cmp > 0 : dot(x.v, a[y.t] - a[x.t]) > 0;
	}
}l[M], upd[M];
void init(int p) {
	cnt = 0;
	static int perm[N], rev[N];
	for(int i = id[p]; i <= n; i ++) perm[i] = tmp[i];
	fill(rev + 1, rev + n + 1, 0);
	sort(perm + id[p] + 1, perm + n + 1, [&] (int x, int y) {		
		return cross(a[x] - a[p], a[y] - a[p]) > 0;
	});
	for(int i = id[p]; i <= n; i ++) rev[perm[i]] = i;
	for(int l = id[p] + 1, r = l; l <= n; l = r) {
		int cnt = 1;
		while(r <= n && cross(a[perm[r]] - a[p], a[perm[l]] - a[p]) == 0) cnt = (1 + ok[p][perm[r ++]]) * cnt % mod;
		ans = (ans + cnt - 1) % mod;
	}
	for(int i = 1; i <= m; i ++) {
		int s = l[i].s, t = l[i].t;
		if(id[s] >= id[p] && id[t] >= id[p]) {
			if(s == p) {
				if(ok[p][t]) upd[++ cnt] = l[i];
			} else if(t == p) {
				if(ok[p][s]) upd[++ cnt] = l[i];
			} else if(ok[s][t] && ok[s][p] && ok[t][p]) {
				upd[++ cnt] = l[i];
			}
		}
	}
}
bool seg_cross(Point s1, Point t1, Point s2, Point t2) {
	int a = sgn(cross(t1 - s1, s2 - s1)), b = sgn(cross(t1 - s1, t2 - s1));
	int c = sgn(cross(t2 - s2, s1 - s2)), d = sgn(cross(t2 - s2, t1 - s2));
	return a * b == -1 && c * d == -1;
}
bool onseg(Point s, Point t, Point p) {
	return cross(t - s, p - s) == 0 && dot(t - s, p - s) > 0 && dot(s - t, p - t) > 0;
}
bool online(Point s, Point t, Point p) {
	return cross(t - s, p - s) == 0;
}
bool inpolygon(Point p) {
	int rev = 0;
	for(int i = 1; i <= n; i ++) {
		Point s = a[i], t = a[i % n + 1];
		i64 cur = cross(t - s, p - s);
		if(onseg(s, t, p)) return 1;
		if(s.y < p.y && p.y <= t.y && cur > 0) rev ^= 1;
		if(s.y >= p.y && p.y > t.y && cur < 0) rev ^= 1;
	}
	return rev;
}
int main() {
	// freopen("in.txt", "r", stdin);
	ios::sync_with_stdio(false), cin.tie(0);
	cin >> n;
	for(int i = 1; i <= n; i ++) {
		cin >> a[i];
		a[i].x *= 2, a[i].y *= 2;
		tmp[i] = i;
	}
	sort(tmp + 1, tmp + n + 1, [&] (int x, int y) {return a[x] < a[y];});
	for(int i = 1; i <= n; i ++) id[tmp[i]] = i;
	memset(ok, -1, sizeof(ok));
	function<int(int, int)> dfs = [&] (int i, int j) {
		if(~ok[i][j]) return ok[i][j];
		int flag = 1;
		for(int k = 1; k <= n; k ++) {
			if(seg_cross(a[i], a[j], a[k], a[k % n + 1])) {
				flag = 0;
			}
		}
		if(flag) {
			for(int k = 1; k <= n; k ++) if(k != i && k != j) {
				if(onseg(a[i], a[j], a[k])) {
					return ok[i][j] = dfs(i, k) & dfs(k, j);
				}
			}
			Point cur = Point(a[i].x + a[j].x >> 1, a[i].y + a[j].y >> 1);
			flag &= inpolygon(cur);
		}
		return ok[i][j] = flag;
	};
	for(int i = 1; i <= n; i ++) {
		for(int j = 1; j <= n; j ++) if(i != j) {
			l[++ m] = {i, j, a[j] - a[i]};
			dfs(i, j);
		}
	}
	sort(l + 1, l + m + 1);
	for(int p = 1; p <= n; p ++) {
		init(p);
		static int dp[2][N];
		memset(dp, 0, sizeof(dp));
		for(int i = 1; i <= cnt; i ++) {
			int s = upd[i].s, t = upd[i].t;
			if(s == p) dp[0][t] ++; 
			else {
				for(int i = 0; i < 2; i ++) {
					int j = min(1, i + !online(a[p], a[s], a[t]));
					dp[j][t] = (dp[j][t] + dp[i][s]) % mod;
				}
			}
		}
		ans = (ans + dp[1][p]) % mod;
	}
	cout << ans << '\n';
	return 0;
}