#include <bits/stdc++.h>
#define re(i, n) for(int i = 0; i < n; ++i)
using namespace std;
const int MXN = 210, mol = 998244353;
int n, ans = 0, pow2[MXN] = {1};

struct point {
    int x, y;
}p[MXN];

int multi(point a, point b, point c) {
    return a.x * (b.y - c.y) + b.x * (c.y - a.y) + c.x * (a.y - b.y);
}

int main() {
    cin >> n;
    re(i, n) cin >> p[i].x >> p[i].y, pow2[i + 1] = pow2[i] * 2 % mol;
    ans = (pow2[n] + mol - n - 1) % mol;
    re(i, n)
        re(j, i) {
            int t = 0;
            re(k, j) {
                if (multi(p[i], p[j], p[k]) == 0) ++t;
            }
            ans = (ans + mol - pow2[t]) % mol;
        }
    cout << ans << endl;
    return 0;
}
