#include<bits/stdc++.h>
using std::cin;
using std::cout;
const int N = 205;
const int mod = 998244353;
void add(int & x, int y) {
	if((x += y) >= mod) {
		x -= mod;
	}
}
using ll = long long;
int n;
ll sgn(ll x) {
	return x < 0 ? -1 : x > 0;
}
struct vec2 {
	int x, y;
	ll norm() {
		return (ll) x * x + (ll) y * y;
	}
	vec2() {}
	vec2(int a, int b) : x(a), y(b) {}
} a[N];
vec2 operator + (vec2 x, vec2 y) {
	return vec2(x.x + y.x, x.y + y.y);
}
vec2 operator - (vec2 x, vec2 y) {
	return vec2(x.x - y.x, x.y - y.y);
}
ll operator * (vec2 x, vec2 y) {
	return (ll) x.x * y.y - (ll) x.y * y.x;
}
ll operator % (vec2 x, vec2 y) {
	return (ll) x.x * y.x + (ll) x.y * y.y;
}
bool operator == (vec2 x, vec2 y) { 
	return x.x == y.x && x.y == y.y;
}
struct seg {
	vec2 x, y;
} b[N];
int e[N][N];
bool test(vec2 x, vec2 y, vec2 z) {
	return (y - x) * (z - x) == 0;
}
void link(int x, int y) {
	if(e[x][y]) return ;
	e[x][y] = 1;
	e[y][x] = 1;
	for(int i = 1;i <= n;++i) {
		if(!e[y][i] && e[x][i] && e[x][y] && test(a[i], a[x], a[y])) {
			link(i, y);
		}
	}
	std::swap(x, y);
	for(int i = 1;i <= n;++i) {
		if(!e[y][i] && e[x][i] && e[x][y] && test(a[i], a[x], a[y])) {
			link(i, y);
		}
	}
}
int ccw(vec2 a, vec2 b, vec2 c) {
	int sign = sgn((b - a) * (c - a));
	if(sign == 0) {
		if(sgn((b - a) % (c - a)) == -1) {
			return 2;
		}
		if((c - a).norm() > (b - a).norm()) {
			return -2;
		}
	}
	return sign;
}
int is_isc(const seg & x, const seg & y) {
	return
		ccw(x.x, x.y, y.x) * ccw(x.x, x.y, y.y) <= 0 &&
		ccw(y.x, y.y, x.x) * ccw(y.x, y.y, x.y) <= 0;
}
int half(const vec2 & x) {
	return x.y < 0 || (x.y == 0 && x.x <= 0);
}
bool cmp(vec2 A, vec2 B) {
	if(half(A) != half(B)) return half(B);
	return A * B > 0;
}
bool cmp_eq(vec2 A, vec2 B) {
	return half(A) == half(B) && A * B == 0;
}
struct pr { // 凸包 DP
	int i, j;
	vec2 get() const {
		return a[j] - a[i];
	}
};
bool cmpseg(pr x, pr y) {
	vec2 A = x.get(), B = y.get();
	if(!cmp(A, B) && !cmp(B, A)) {
		return a[x.i] % A < a[y.i] % A;
	}
	return cmp(A, B);
}
// 判断 A, B, C 三个向量是否是逆时针顺序
// 如果是，返回 1
// 如果 (A, B), (C, B) 同方向共线，返回 -1
// 如果是顺时针，返回 0
bool cmp_ct(vec2 A, vec2 B, vec2 C) {
	if(cmp_eq(A, B)) return -1;
	if(cmp_eq(C, B)) return -1;
	if(cmp(A, B)) {
		return cmp(B, C) || cmp(C, A);
	} else {
		return cmp(B, C) && cmp(C, A);
	}
}
bool valid(int i, int j) {
	vec2 dir = a[j] - a[i];
	vec2 A = vec2(a[i % n + 1] - a[i]);
	vec2 B = vec2(a[i == 1 ? n : i - 1] - a[i]);
	return cmp_ct(A, dir, B) == 1;
}
int dp[N][N];
int f[N];
int g[N];
using u64 = unsigned long long;
int pow(int a, int b, int ans = 1) {
	for(;b;b >>= 1, a = (u64) a * a % mod) {
		if(b & 1) ans = (u64) ans * a % mod;
	}
	return ans;
}
void init() {
	for(int i = 1;i <= n;++i) {
		f[i] = (pow(2, i) + mod - i - 1) % mod;
		for(int j = 2;j <= i;++j) {
			g[i ] = (g[i] + (u64) (i - j + 1) * pow(2, (j - 2) * 2)) % mod;
		}
	}
}
int pb() {
	int ans = 0;
	for(int i = 1;i <= n;++i) {
		for(int j = 1;j < i;++j) if(e[i][j]) {
			std::vector<int> set = {i, j};
			for(int k = 1;k <= n;++k) if(k != i && k != j) {
				if(e[i][k] && test(a[i], a[j], a[k])) {
					set.push_back(k);
				}
			}
			for(int x : set) for(int y : set) {
				e[x][y] = e[y][x] = 0;
			}
			ans = (ans + mod - g[set.size()]) % mod;
			ans = (ans + f[set.size()]) % mod;
		}
	}
	return ans;
}
int main() {
	std::ios::sync_with_stdio(false), cin.tie(0);
	cin >> n;
	for(int i = 1;i <= n;++i) {
		cin >> a[i].x >> a[i].y;
		e[i][i] = 1;
	}
	for(int i = 1;i <= n;++i) {
		b[i].x = a[i];
		b[i].y = a[i % n + 1];
		link(i, i % n + 1);
	}
	for(int i = 1;i <= n;++i) {
		for(int j = i + 2;j <= n;++j) {
			if(!e[i][j]) {
				if(valid(i, j) && valid(j, i)) {
					int good = 1;
					for(int k = 1;k <= n;++k) {
						int pk = k % n + 1;
						if(i == k || i == pk || j == k || j == pk) {
							continue;
						}
						if(is_isc(seg{a[i], a[j]}, b[k])) {
							good = 0;
							break;
						}
					}
					if(good) {
						link(i, j);
					}
				}
			}
		}
	}
	std::vector<pr> v;
	for(int i = 1;i <= n;++i) {
		for(int j = 1;j <= n;++j) if(i != j && e[i][j]) {
			v.push_back({i, j});
		}
	}
	sort(v.begin(), v.end(), cmpseg);
	int ans = mod - n;
	for(int i = 1;i <= n;++i) {
		dp[i][i] = 1;
	}
	for(auto [x, y] : v) {
		for(int i = 1;i <= n;++i) {
			add(dp[y][i], dp[x][i]);
		}
	}
	init();
	for(int i = 1;i <= n;++i) {
		add(ans, dp[i][i]);
	}
	ans = (ans + pb()) % mod;
	cout << ans << '\n';
}