#include <bits/extc++.h>
#include <bits/stdc++.h>

using namespace std;

#define int int64_t

typedef int64_t ftype;
typedef complex<ftype> point;
#define x real
#define y imag

ftype dot(point a, point b)
{
	return (conj(a) * b).x();
}

ftype cross(point a, point b)
{
	return (conj(a) * b).y();
}

const int mod = 998244353;

void add_mod(int &a, int b)
{
	a += b;
	while(a >= mod)
		a -= mod;
	while(a < 0)
		a += mod;
}

signed main()
{
	//freopen("input.txt", "r", stdin);
	ios::sync_with_stdio(0);
	cin.tie(0);
	int n;
	cin >> n;
	point r[n];
	for(int i = 0; i < n; i++)
	{
		int x, y;
		cin >> x >> y;
		r[i] = {x, y};
	}
	int ans = 0;
	for(int s = 0; s < n; s++)
	{
		point o = r[s];
		vector<point> pts;
		for(int i = 0; i < n; i++)
			if(r[i].y() > o.y() || r[i].y() == o.y() && r[i].x() > o.x())
				pts.push_back(r[i]);
		sort(begin(pts), end(pts), [&](point a, point b)
			{return cross(a - o, b - o) < 0 || cross(a - o, b - o) == 0 && norm(a) < norm(b);});
		int m = pts.size();
		int dp[m][m];
		for(int i = 0; i < m; i++)
			for(int j = 0; j < m; j++)
				dp[i][j] = 0;
		for(int r = 0; r < m; r++)
			for(int l = 0; l < r; l++)
			{
				if(cross(pts[r] - o, pts[l] - o) == 0)
					continue;
				dp[l][r] = 1;
				for(int p = 0; p < l; p++)
					if(cross(pts[p] - o, pts[l] - o) == 0)
						add_mod(dp[l][r], dp[l][r]);
				for(int p = 0; p < l; p++)
					if(cross(pts[l] - pts[p], pts[r] - pts[p]) < 0)
						add_mod(dp[l][r], dp[p][l]);
				for(int p = l + 1; p < r; p++)
					if(cross(pts[r] - pts[l], pts[p] - pts[l]) <= 0)
						add_mod(dp[l][r], dp[l][r]);
				add_mod(ans, dp[l][r]);
			}
	}
	cout << ans << endl;
    return 0;
}