// {{{ Templates
#include <bits/stdc++.h>

#define show(x) cerr << #x << " = " << x << endl

using namespace std;
using ll = long long;
using pii = pair<int, int>;
using vi = vector<int>;

template <typename T>
ostream& operator<<(ostream& os, const vector<T>& v)
{
    os << "sz:" << v.size() << "\n[";
    for (const auto& p : v) {
        os << p << ",";
    }
    os << "]\n";
    return os;
}

template <typename S, typename T>
ostream& operator<<(ostream& os, const pair<S, T>& p)
{
    os << "(" << p.first << "," << p.second
       << ")";
    return os;
}


constexpr ll MOD = 998244353LL;

template <typename T>
constexpr T INF = numeric_limits<T>::max() / 100;

// }}}

inline bool on(ll x0, ll y0, ll x1, ll y1, ll x, ll y)
{
    const ll DX = x1 - x0;
    const ll DY = y1 - y0;
    const ll dx = x - x0;
    const ll dy = y - y0;
    return dx * DY == dy * DX;
}

ll power(const ll p, const ll n)
{
    if (n == 0) {
        return 1;
    }
    if (n % 2 == 1) {
        return (power(p, n - 1) * p) % MOD;
    } else {
        const ll pp = power(p, n / 2);
        return (pp * pp) % MOD;
    }
}

inline ll calc(const ll n)
{
    if (n <= 2) {
        return 0;
    }
    return (((power(2, n) - (n * n + n + 2) / 2) % MOD) + MOD) % MOD;
}

struct Line {
    Line(ll ind_, ll dx_, ll dy_)
    {
        ind = ind_;
        if (dx_ < 0) {
            dx_ *= -1;
            dy_ *= -1;
        } else if (dx_ == 0) {
            dy_ = 1;
        }
        if (dy_ == 0) {
            dx_ = 1;
        }
        dx = dx_;
        dy = dy_;
    }
    ll ind;
    ll dx;
    ll dy;
    bool operator<(const Line& l) const
    {
        return (ind != l.ind) ? ind < l.ind : dx * l.dy < dy * l.dx;
    }
};

ostream& operator<<(ostream& os, const Line& l)
{
    os << "{ind: " << l.ind << " dx: " << l.dx << " dy:" << l.dy << "}";
    return os;
}

int main()
{
    cin.tie(0);
    ios::sync_with_stdio(false);
    int N;
    cin >> N;
    vector<ll> x(N);
    vector<ll> y(N);
    for (int i = 0; i < N; i++) {
        cin >> x[i] >> y[i];
    }
    map<Line, ll> lines;
    for (int i = 0; i < N; i++) {
        for (int j = i + 1; j < N; j++) {
            for (int k = 0; k < N; k++) {
                if (k == i or k == j) {
                    continue;
                }
                if (on(x[i], y[i], x[j], y[j], x[k], y[k])) {
                    const Line ln = Line{min({i, j, k}), x[j] - x[i], y[j] - y[i]};
                    if (lines.find(ln) == lines.end()) {
                        lines[ln] = 3;
                        for (int l = 0; l < N; l++) {
                            if (l == i or l == j or l == k) {
                                continue;
                            }
                            if (on(x[i], y[i], x[j], y[j], x[l], y[l])) {
                                lines[ln]++;
                            }
                        }
                    }
                    break;
                }
            }
        }
    }
    ll sum = calc(N);
    for (const auto& e : lines) {
        show(e);
        sum -= calc(e.second);
        sum = ((sum % MOD) + MOD) % MOD;
    }
    cout << sum << endl;

    return 0;
}


Measured memory_bytes: 384