#include <iostream>
#include <algorithm>
#include <vector>
#include <string>
#include <cmath>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
const int mod = 1000000007;

int main() {
    ios::sync_with_stdio(false);
    int n, x[213] = {}, y[213] = {}, p[213] = {1}, z = 0;
    bool b[213][213] = {};
    cin >> n;
    for (int i = 1; i <= n; i++) p[i] = p[i - 1] * 2 % 998244353;
    for (int i = 1; i <= n; i++) cin >> x[i] >> y[i];
    for (int i = 1; i <= n; i++) for (int j = i + 1; j <= n; j++) if (!b[i][j]) {
        vector<int> c = {i, j};
        int w = 2;
        for (int k = j + 1; k <= n; k++) if ((x[i] - x[j]) * (y[i] - y[k]) == (y[i] - y[j]) * (x[i] - x[k])) w++, c.push_back(k);
        for (int k : c) for (int l : c) b[k][l] = 1;
        z = (z + p[w] - 1 - w) % 998244353;
    }
    cout << (p[n] - z - n + 998244352) % 998244353;
}
