import std.stdio, std.array, std.string, std.conv, std.algorithm;
import std.typecons, std.range, std.random, std.math, std.container;
import std.numeric, std.bigint, core.bitop;


long powmod(long a, long x, long m) {
    long ret = 1;
    while (x) {
        if (x % 2) ret = ret * a % m;
        a = a * a % m;
        x /= 2;
    }
    return ret;
}

void main() {
    auto N = readln.chomp.to!int;
    auto X = new long[](N);
    auto Y = new long[](N);
    foreach (i; 0..N) {
        auto s = readln.split.map!(to!long);
        X[i] = s[0];
        Y[i] = s[1];
    }

    const long MOD = 998244353;
    const real INF = 1L << 59;

    real slope(int i, int j) {
        if (X[i] == X[j]) return 1L << 59;
        return 1.0L * (Y[j] - Y[i]) / (X[j] - X[i]);
    }

    real intercept(int i, int j) {
        if (X[i] == X[j]) return X[i];
        return 1.0L * (X[i] * Y[j] - 2 * X[i] * Y[i] + X[j] * Y[i]) / (X[j] - X[i]);
    }

    bool[real][real] used;
    long ans = 1 + N;


    foreach (i; 0..N) {
        foreach (j; i+1..N) {
            auto a = slope(i, j);
            auto b = intercept(i, j);
            if (a in used && b in used[a])
                continue;
            used[a][b] = true;
            long cnt = 2;

            foreach (k; j+1..N) {
                auto c = slope(i, k);
                auto d = intercept(i, k);
                if (a == c && b == d)
                    cnt += 1;
            }

            ans += powmod(2, cnt, MOD) - cnt - 1;
            ans %= MOD;
        }
    }

    ans = powmod(2, N, MOD) - ans;
    ans = (ans % MOD + MOD) % MOD;
    ans.writeln;

}
