/*
СТРОИМ СТЕНУ РАБОТЯГИ!
█▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀█
█═╩═╦═╩═╦═╩═╦═╩═╦═╩═╦═╩═╦═╩═█
█═╦═╩═╦═╩═╦═╩═╦═╩═╦═╩═╦═╩═╦═█
█═╩═╦═╩═╦═╩═╦═╩═╦═╩═╦═╩═╦═╩═█
█═╦═╩═╦═╩═╦═╩═╦═╩═╦═╩═╦═╩═╦═█
█═╩═╦═╩═╦═╩═╦═╩═╦═╩═╦═╩═╦═╩═█
█═╦═╩═╦═╩═╦═╩═╦═╩═╦═╩═╦═╩═╦═█
█═╩═╦═╩═╦═╩═╦═╩═╦═╩═╦═╩═╦═╩═█
█═╦═╩═╦═╩═╦═╩═╦═╩═╦═╩═╦═╩═╦═█
█▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄█
*/
#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <cstdio>
#include <numeric>
#include <cstring>
#include <ctime>
#include <cstdlib>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <list>
#include <cmath>
#include <bitset>
#include <cassert>
#include <queue>
#include <stack>
#include <deque>
    
     
     
using namespace std;
template<typename T1, typename T2>inline void chkmin(T1 &x, T2 y) { if (x > y) x = y; }
template<typename T1, typename T2>inline void chkmax(T1 &x, T2 y) { if (x < y) x = y; }
/** Interface */
     
inline int readChar();
template <class T = int> inline T readInt(); 
template <class T> inline void writeInt( T x, char end = 0 );
inline void writeChar( int x ); 
inline void writeWord( const char *s );
     
/** Read */
     
static const int buf_size = 4096;
     
inline int getChar() {
    static char buf[buf_size];
    static int len = 0, pos = 0;
    if (pos == len) {
        pos = 0, len = fread(buf, 1, buf_size, stdin);
    }
    if (pos == len) {
        return -1;
    }
    return buf[pos++];
}
     
inline int readChar() {
    int c = getChar();
    while (c <= 32) {
        c = getChar();
    }
    return c;
}
     
template <class T>
inline T readInt() {
    int s = 1, c = readChar();
    T x = 0;
    if (c == '-')
        s = -1, c = getChar();
    while ('0' <= c && c <= '9')
        x = x * 10 + c - '0', c = getChar();
    return s == 1 ? x : -x;
}
     
/** Write */
     
static int write_pos = 0;
static char write_buf[buf_size];
     
inline void writeChar( int x ) {
    if (write_pos == buf_size)
        fwrite(write_buf, 1, buf_size, stdout), write_pos = 0;
    write_buf[write_pos++] = x;
}
     
template <class T> 
inline void writeInt( T x, char end ) {
    if (x < 0)
        writeChar('-'), x = -x;
     
    char s[24];
    int n = 0;
    while (x || !n)
        s[n++] = '0' + x % 10, x /= 10;
    while (n--)
        writeChar(s[n]);
    if (end)
        writeChar(end);
}
     
inline void writeWord( const char *s ) {     while (*s)
writeChar(*s++); }
     
struct Flusher {
    ~Flusher() {
        if (write_pos)
            fwrite(write_buf, 1, write_pos, stdout), write_pos = 0;
    }
} flusher;   
#define sz(c) (int)(c).size()
#define all(c) (c).begin(), (c).end()
#define rall(c) (c).rbegin(), (c).rend()
#define left left228
#define right right228
#define next next228
#define rank rank228
#define prev prev228
#define get get228
#define y1 y1228                                                         
const int MAXN = 201;
const int Mod = 998244353;


struct point
{   
    int x, y;
    point(){}
    point(int _x, int _y) {
        x = _x;
        y = _y;
    }
};


point operator -(point a, point b) {
    return point(a.x - b.x, a.y - b.y);
}


int vec(point a, point b) {
    return a.x * b.y - a.y * b.x;
}


int scal(point a, point b) {
    return a.x * b.x + a.y * b.y;
}


bool good(point a, point b, point c) {
    return vec(b - a, c - a) != 0;
}


bool inside(point a, point b, point c, point x) {
    int f = vec(b - a, x - a);
    int f1 = vec(c - b, x - b);
    int f2 = vec(a - c, x - c);
    return (f >= 0 && f1 >= 0 && f2 >= 0) || (f <= 0 && f1 <= 0 && f2 <= 0);
}


bool operator <(point a, point b) {
    return a.x < b.x || (a.x == b.x && a.y < b.y);
}


point cur;


bool comp(point a, point b) {
    if (vec(a - cur, b - cur) == 0) {
        return (a.x - cur.x) * (a.y - cur.y) > (b.x - cur.x) * (b.y - cur.y);
    }
    return vec(a - cur, b - cur) > 0;
}


int n;
point p[MAXN];
bool need[MAXN];
bool goods[MAXN][MAXN];
int dp[MAXN][MAXN];
int st[MAXN];
int adds[MAXN];


int main() {    
    n = readInt();
    for (int i = 0; i < n; i++) {
        p[i].x = readInt(), p[i].y = readInt();
    }
    st[0] = 1; 
    for (int i = 1; i <= n; i++) {
        st[i] = (st[i - 1] * 2) % Mod;
    }
    int ans = st[n];
    ans = (ans - 1 + Mod) % Mod;
    ans = (ans - n + Mod) % Mod;
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < n; j++) {
            if (!(p[i] < p[j])) {
                continue;
            }
            int cnt = 0;
            for (int k = 0; k < n; k++) {
                if (k != i && k != j && vec(p[k] - p[i], p[j] - p[k]) == 0 && p[i] < p[k] && p[k] < p[j]) {
                    cnt++;
                }
            }
            ans = (ans - st[cnt] + Mod) % Mod;
        }
    }
    writeInt(ans, '\n');
    return 0;
}



Measured memory_bytes: 256