#include<bits/stdc++.h>
using namespace std;
#define LL long long
const int N = 211;
const int mod = 998244353;
int n;
LL base[N];
struct ddd{
    int x, y;
}nd[N];
LL sq(LL x){return x * x;}
bool check(LL x1, LL y1, LL x2, LL y2){
    LL a = x1 * x2 + y1 * y2;
    LL b = (sq(x1) + sq(y1)) * (sq(x2) + sq(y2));
    return a > 0 && b == sq(a);
}
int main(){
    cin>>n;
    for(int i = 1;i <= n; i++){
        scanf("%d%d", &nd[i].x, &nd[i].y);
    }
    base[0] = 1;
    for(int i = 1;i <= 200; i++)base[i] = base[i-1] * 2 % mod;
    LL ans = (base[n] - 1 - n + mod) % mod;
    for(int i = 2;i <= n; i++){
        for(int j = 1;j < i; j++){
            int tot = 0;
            for(int k = 1;k <= n; k++){
                if(i == k || j == k)continue;
                if(check(nd[i].x - nd[k].x, nd[i].y - nd[k].y, nd[k].x - nd[j].x, nd[k].y - nd[j].y))tot++;
            }
            ans = (ans + mod - base[tot]) % mod;
            //printf("i=%d j=%d tot=%d\n", i, j, tot);
        }
    }
    cout<<ans<<endl;
    return 0;
}
