#include <bits/stdc++.h>
#define ll long long
#define INF 1000000005
#define MOD 998244353
#define EPS 1e-10
#define rep(i,n) for(int i=0;i<(int)(n);++i)
#define rrep(i,n) for(int i=(int)(n)-1;i>=0;--i)
#define srep(i,s,t) for(int i=(int)(s);i<(int)(t);++i)
#define each(a,b) for(auto& (a): (b))
#define all(v) (v).begin(),(v).end()
#define len(v) (int)(v).size()
#define zip(v) sort(all(v)),v.erase(unique(all(v)),v.end())
#define cmx(x,y) x=max(x,y)
#define cmn(x,y) x=min(x,y)
#define fi first
#define se second
#define pb push_back
#define show(x) cout<<#x<<" = "<<(x)<<endl
#define spair(p) cout<<#p<<": "<<p.fi<<" "<<p.se<<endl
#define sar(a,n) cout<<#a<<":";rep(kbrni,n)cout<<" "<<a[kbrni];cout<<endl
#define svec(v) cout<<#v<<":";rep(kbrni,v.size())cout<<" "<<v[kbrni];cout<<endl
#define svecp(v) cout<<#v<<":";each(kbrni,v)cout<<" {"<<kbrni.first<<":"<<kbrni.second<<"}";cout<<endl
#define sset(s) cout<<#s<<":";each(kbrni,s)cout<<" "<<kbrni;cout<<endl
#define smap(m) cout<<#m<<":";each(kbrni,m)cout<<" {"<<kbrni.first<<":"<<kbrni.second<<"}";cout<<endl

using namespace std;

typedef pair<int, int> P;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<double> vd;
typedef vector<P> vp;
typedef vector<string> vs;
typedef pair<P,P> PP;

const int MAX_N = 205;

int inv[MAX_N],fac[MAX_N],finv[MAX_N];

inline void make()
{
	fac[0] = fac[1] = 1;
	finv[0] = finv[1] = 1;
	inv[1] = 1;
	for(int i=2;i<MAX_N;i++){
		inv[i] = MOD - (ll)inv[MOD%i] * (MOD/i) % MOD;
		fac[i] = (ll)fac[i-1] * i % MOD;
		finv[i] = (ll)finv[i-1] * inv[i] % MOD;
	}
}

inline int comb(int a,int b)
{
	if(a<b){
		return 0;
	}
	return (ll)fac[a] * ((ll)finv[b] * finv[a-b] % MOD) % MOD;
}

inline int add(int x,int y)
{
    return (x+y)%MOD;
}

inline int sub(int x,int y)
{
    return (x+MOD-y)%MOD;
}

inline int mul(int x,int y)
{
    return (ll)x*y%MOD;
}

int sm[MAX_N];
vector<PP> line;

ll gcd(ll a, ll b)
{
    if(!b) return a;
    if(a % b == 0){
        return b;
    }else{
        return gcd(b,a%b);
    }
}

int main()
{
    cin.tie(0);
    ios::sync_with_stdio(false);
    int n;
    cin >> n;
    vi x(n), y(n);
    rep(i,n){
        cin >> x[i] >> y[i];
    }
    make();
    srep(i,3,n+1){
        srep(j,3,i+1){
            sm[i] = add(sm[i], comb(i, j));
        }
    }
    int ans = sm[n];
    rep(i,n){
        srep(j,i+1,n){
            if(x[i] == x[j]){
                line.pb(PP(P(INF, 0), P(x[i], 1)));
            }else if(y[i] == y[j]){
                line.pb(PP(P(0, 0), P(y[i], 1)));
            }else{
                int dx = x[j] - x[i], dy = y[j] - y[i];
                int g = gcd(abs(dx), abs(dy));
                P a;
                if(dx * dy < 0){
                    a = P(abs(dx)/g,-abs(dy)/g);
                }else{
                    a = P(abs(dx)/g,abs(dy)/g);
                }
                int ddx = a.fi, ddy = y[i]*a.fi-a.se*x[i];
                line.pb(PP(a, P(ddx, ddy)));
            }
        }
    }
    zip(line);
    // show(ans);
    each(it, line){
        P a = it.fi, b = it.se;
        // spair(a), spair(b);
        int res = 0;
        if(a.fi == INF){
            rep(i,n){
                res += (x[i] == b.fi);
            }
        }else if(a.fi == 0){
            rep(i,n){
                res += (y[i] == b.fi);
            }
        }else{
            rep(i,n){
                int p = a.fi, q = a.se*x[i]+b.se;
                int g = gcd(p, q);
                p /= g, q /= g;
                res += (p == 1 && q == y[i]);
            }
        }
        // show(res);
        ans = sub(ans, sm[res]);
    }
    cout << ans << "\n";
    return 0;
}


Measured memory_bytes: 892