#include<stdio.h>
#include<iostream>
#include<vector>
#include<algorithm>
#include<string>
#include<string.h>

#ifdef LOCAL
#define eprintf(...) fprintf(stderr, __VA_ARGS__)
#else
#define NDEBUG
#define eprintf(...) do {} while (0)
#endif
#include<cassert>

using namespace std;

typedef long long LL;
typedef vector<int> VI;

#define REP(i,n) for(int i=0, i##_len=(n); i<i##_len; ++i)
#define EACH(i,c) for(__typeof((c).begin()) i=(c).begin(),i##_end=(c).end();i!=i##_end;++i)

template<class T> inline void amin(T &x, const T &y) { if (y<x) x=y; }
template<class T> inline void amax(T &x, const T &y) { if (x<y) x=y; }
template<class Iter> void rprintf(const char *fmt, Iter begin, Iter end) {
    for (bool sp=0; begin!=end; ++begin) { if (sp) putchar(' '); else sp = true; printf(fmt, *begin); }
    putchar('\n');
}
template<unsigned MOD> struct ModInt {
    static const unsigned static_MOD = MOD;
    unsigned x;
    void undef() { x = (unsigned)-1; }
    bool isnan() const { return x == (unsigned)-1; }
    inline int geti() const { return (int)x; }
    ModInt() { x = 0; }
    ModInt(const ModInt &y) { x = y.x; }
    ModInt(int y) { if (y<0 || (int)MOD<=y) y %= (int)MOD; if (y<0) y += MOD; x=y; }
    ModInt(unsigned y) { if (MOD<=y) x = y % MOD; else x = y; }
    ModInt(long long y) { if (y<0 || MOD<=y) y %= MOD; if (y<0) y += MOD; x=y; }
    ModInt(unsigned long long y) { if (MOD<=y) x = y % MOD; else x = y; }
    ModInt &operator+=(const ModInt y) { if ((x += y.x) >= MOD) x -= MOD; return *this; }
    ModInt &operator-=(const ModInt y) { if ((x -= y.x) & (1u<<31)) x += MOD; return *this; }
    ModInt &operator*=(const ModInt y) { x = (unsigned long long)x * y.x % MOD; return *this; }
    ModInt &operator/=(const ModInt y) { x = (unsigned long long)x * y.inv().x % MOD; return *this; }
    ModInt operator-() const { return (x ? MOD-x: 0); }

    ModInt inv() const {
	unsigned a = MOD, b = x; int u = 0, v = 1;
	while (b) {
	    int t = a / b;
	    a -= t * b; swap(a, b);
	    u -= t * v; swap(u, v);
	}
	if (u < 0) u += MOD;
	return ModInt(u);
    }
    ModInt pow(long long y) const {
	ModInt b = *this, r = 1;
	if (y < 0) { b = b.inv(); y = -y; }
	for (; y; y>>=1) {
	    if (y&1) r *= b;
	    b *= b;
	}
	return r;
    }
    friend ModInt operator+(ModInt x, const ModInt y) { return x += y; }
    friend ModInt operator-(ModInt x, const ModInt y) { return x -= y; }
    friend ModInt operator*(ModInt x, const ModInt y) { return x *= y; }
    friend ModInt operator/(ModInt x, const ModInt y) { return x *= y.inv(); }
    friend bool operator<(const ModInt x, const ModInt y) { return x.x < y.x; }
    friend bool operator==(const ModInt x, const ModInt y) { return x.x == y.x; }
    friend bool operator!=(const ModInt x, const ModInt y) { return x.x != y.x; }
};

const LL MOD = 998244353;
typedef ModInt<MOD> Mint;

struct Point {
    LL x, y;
    bool operator<(const Point &o) const {
	return x != o.x? x < o.x : y < o.y;
    }
} P[201];

int ccw(const Point &a, const Point &b, const Point &c) {
    LL x0 = b.x - a.x;
    LL y0 = b.y - a.y;
    LL x1 = c.x - a.x;
    LL y1 = c.y - a.y;
    LL crs = x0 * y1 - x1 * y0;
    if (crs > 0) return 1;
    if (crs < 0) return -1;
    return 0;
}

int B[201][201];
int C[201][201];
int N;

Mint pow2[211], pow_inv2[211];
Mint U[201][201], D[201][201];
Mint Ux[201], Dx[201];

void MAIN() {
    scanf("%d", &N);
    REP (i, N) scanf("%lld%lld", &P[i].x, &P[i].y);

    sort(P, P+N);

    pow2[0] = pow_inv2[0] = 1;
    pow2[1] = 2;
    pow_inv2[1] = (MOD + 1) / 2;
    for (int i=1; i<=N; i++) {
	pow2[i+1] = pow2[i] * pow2[1];
	pow_inv2[i+1] = pow_inv2[i] * pow_inv2[1];
    }

    REP (a, N) for (int i=a+1; i<N; i++) for (int b=i+1; b<N; b++) {
	int c = ccw(P[a], P[i], P[b]);
	if (c == 1 || c == 0) B[a][b]++;
	if (c == 1) C[a][b]++;
    }

//    REP (i, N) eprintf("(%lld %lld)\n", P[i].x, P[i].y);
//    REP (a, N) for (int b=a+1; b<N; b++) {
//	eprintf("%d %d : %d\n", a, b, B[a][b]);
//    }

    Mint ans = 0;
    REP (s, N) {
	memset(U, 0, sizeof U);
	memset(D, 0, sizeof D);
	for (int i=s+1; i<N; i++) {
	    U[s][i] += pow2[B[s][i]];
	    D[s][i] += pow_inv2[C[s][i]];
	    ans -= U[s][i] * D[s][i];
	}
	
	for (int i=s; i<N; i++) for (int j=i+1; j<N; j++) for (int k=j+1; k<N; k++) {
	    int c = ccw(P[i], P[j], P[k]);
	    if (c == -1) U[j][k] += U[i][j] * pow2[B[j][k]];
	    if (c == 1) D[j][k] += D[i][j] * pow_inv2[C[j][k]+1];
	}

	memset(Ux, 0, sizeof Ux);
	memset(Dx, 0, sizeof Dx);
	for (int i=s; i<N; i++) for (int j=i+1; j<N; j++) {
	    Ux[j] += U[i][j];
	    Dx[j] += D[i][j];
	}
	for (int i=s+1; i<N; i++) {
	    ans += Ux[i] * Dx[i];
	}
    }

    printf("%d\n", ans.geti());
}

int main() {
    int TC = 1;
//    scanf("%d", &TC);
    REP (tc, TC) MAIN();
    return 0;
}



Measured memory_bytes: 896