#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define all(x) (x).begin(),(x).end()
const int mod=998244353,MAX=1005,INF=1<<30;

ll rui(ll a,ll b){
    ll ans=1;
    while(b>0){
        if(b&1) ans=ans*a%mod;
        a=a*a%mod;
        b/=2;
    }
    return ans;
}

int main(){
    
    int N;cin>>N;
    vector<int> X(N),Y(N);
    for(int i=0;i<N;i++){
        cin>>X[i]>>Y[i];
    }
    
    ll ans=rui(2,N);
    ans+=mod-(N+1);
    ans%=mod;
    
    for(int a=0;a<N;a++){
        for(int b=a+1;b<N;b++){
            ll cnt=0;
            int left=a,right=b;
            for(int k=0;k<N;k++){
                //if(k==a||k==b) continue;
                if((X[k]-X[a])*(Y[b]-Y[a])-(X[b]-X[a])*(Y[k]-Y[a])==0){
                    left=min(left,k);
                    right=max(right,k);
                    cnt++;
                }
            }
            if(left==a&&right==b) ans+=mod-(rui(2,cnt)-cnt-1)%mod;
            ans%=mod;
        }
    }
    
    cout<<ans<<endl;
}
