#include <iostream>
#include <algorithm>
#include <vector>

using namespace std;

typedef long long ll;

const int MOD = 998244353;

struct Modint {
  ll val;
  
  Modint (ll _val = 0)
    : val(_val % MOD) {}

  Modint operator+ (Modint other) const {
    return Modint(val + other.val);
  }

  void operator+= (Modint other) {
    val += other.val;
    val %= MOD;
  }

  Modint operator- () const {
    return Modint(MOD - val);
  }

  Modint operator- (Modint other) const {
    return Modint(val + MOD - other.val);
  }

  void operator-= (Modint other) {
    val += MOD - other.val;
    val %= MOD;
  }

  Modint operator* (Modint other) const {
    return Modint(val * other.val);
  }

  void operator*= (Modint other) {
    val *= other.val;
    val %= MOD;
  }

  bool operator== (Modint other) const {
    return val == other.val;
  }

  bool operator!= (Modint other) const {
    return val != other.val;
  }
};

Modint exp (Modint a, int k) {
  if (k == 0) {
    return Modint(1);
  } else if (k % 2 == 0) {
    Modint half = exp(a, k / 2);
    return half * half;
  } else {
    return a * exp(a, k - 1);
  }
}

Modint inv (Modint a) {
  return exp(a, MOD - 2);
}

ostream& operator<< (ostream& out, Modint p) {
  out << p.val;
  return out;
}

template<typename T>
T preback (const vector<T> &v) {
  return *next(v.rbegin());
}

typedef pair<int, int> point;
#define x first
#define y second

point operator+ (point p, point q) {
  return {p.x + q.x, p.y + q.y};
}

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

point operator- (point p, point q) {
  return p + (-q);
}

int dot (point p, point q) {
  return p.x * q.x + p.y * q.y;
}

int cross (point p, point q) {
  return p.x * q.y - p.y * q.x;
}

int orient (point p, point q, point r) {
  return cross(q - p, r - p);
}

int cw (point p, point q, point r) {
  return cross(q - p, r - p) < 0;
}

ostream& operator<< (ostream &out, point p) {
  out << "(" << p.x << " " << p.y << ")";
  return out;
}

struct basecomp {
  point base;
  basecomp (point _base) : base(_base) {}

  bool operator() (point p, point q) {
    if (orient(base, p, q) == 0) {
      return dot(p - base, p - base) < dot(q - base, q - base);
    } else {
      return orient(base, p, q) < 0;
    }
  }
};

const int MAX_N = 205;

Modint ans;
Modint dp [MAX_N][MAX_N];

void solve (vector<point> &pts) {
  sort(pts.begin(), pts.end());
  point base = pts[0];
  sort(pts.begin(), pts.end(), basecomp(base));

  int n = pts.size();
  for (int i = 1; i < n; i++) {
    dp[0][i] = 1; // # of points on the line 0..i
    for (int j = 1; j < i; j++) {
      if (orient(base, pts[i], pts[j]) == 0) {
        dp[0][i] *= 2;
      }
    }
  }

  for (int u = 1; u < n; u++) {
    for (int v = u + 1; v < n; v++) {
      dp[u][v] = 0;
      for (int w = 0; w < u; w++) {
        if (cw(pts[w], pts[u], pts[v])) {
          dp[u][v] += dp[w][u];
        }
      }

      // count the # of points in the triangle
      for (int w = u + 1; w < v; w++) {
        if (cw(base, pts[u], pts[w]) &&
            orient(pts[u], pts[v], pts[w]) <= 0 &&
            orient(pts[v], base, pts[w]) <= 0) {
          dp[u][v] *= 2;
        }
      }

      ans += dp[u][v];
    }
  }

  /*
  for (int u = 0; u < n; u++) {
    for (int v = 0; v < n; v++) {
      cout << dp[u][v] << " ";
    }
    cout << endl;
  }

  for (point p : pts) {
    cout << p << " ";
  }
  cout << endl << "  " << ans << endl;
  */
  
  reverse(pts.begin(), pts.end());
  pts.pop_back();
}

int main () {
  ios::sync_with_stdio(false);

  int n;
  cin >> n;

  vector<point> pts (n);
  for (int i = 0; i < n; i++) {
    cin >> pts[i].x >> pts[i].y;
  }

  while ((int) pts.size() >= 3) {
    solve(pts);
  }

  cout << ans << endl;
}


Measured memory_bytes: 640