#include<bits/stdc++.h>
#define Mo 998244353
#define N 500
typedef long long LL;
using namespace std;
int x[N], y[N], b[N], num[N], n;

void prepare() {
    b[0] = 1;
    for(int i = 1; i <= n; i++) b[i] = ((LL)b[i - 1] * 2) % Mo;
    for(int i = 1; i <= n; i++) b[i] = (b[i] - 1 - i - i * (i - 1) / 2) % Mo;
}

int main() {
    cin >> n;
    for(int i = 1; i <= n; i++) cin >> x[i] >> y[i];
    prepare();
    for(int i = 1; i <= n; i++)
        for(int j = 1; j <= n; j++) {
            if (i == j) continue;
            int cnt = 2;
            for(int k = 1; k <= n; k++) {
                if (k == i || k == j) continue;
                if ((LL)(x[k] - x[i]) * (y[k] - y[j]) == (LL)(x[k] - x[j]) * (y[k] - y[i])) cnt++;
            }
            num[cnt]++;
        }
    for(int i = 3; i <= n; i++) num[i] = num[i] / i / (i - 1);
    LL ans = b[n];
    for(int i = 3; i <= n; i++) ans = (ans - (LL)num[i] * b[i] % Mo) % Mo;
    cout << (ans % Mo + Mo) % Mo << endl;
}
