#include<bits/stdc++.h>
#define mod 998244353
using namespace std;
typedef long long ll;
int n,ans,x[501],y[501],pw[501];
int main(){
    scanf("%d",&n);
    pw[0]=1;
    for(int i=1;i<=n;i++)pw[i]=(ll)pw[i-1]*2%mod;
    for(int i=1;i<=n;i++)scanf("%d%d",&x[i],&y[i]);
    ans=(pw[n]-n-1-n*(n-1)/2+mod)%mod;
    for(int i=1;i<=n;i++){
        for(int j=i+1;j<=n;j++){
            int tmp=0;
            for(int k=j+1;k<=n;k++){
                if((y[j]-y[i])*(x[k]-x[j])==(y[k]-y[j])*(x[j]-x[i]))tmp++;
            }
            ans=(ans+mod+1-pw[tmp])%mod;
        }
    }
    printf("%d",ans);
    return 0;
}