#include <cassert>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>

using namespace std;

using Int = long long;

template <class T1, class T2> ostream &operator<<(ostream &os, const pair<T1, T2> &a) { return os << "(" << a.first << ", " << a.second << ")"; };
template <class T> ostream &operator<<(ostream &os, const vector<T> &as) { const int sz = as.size(); os << "["; for (int i = 0; i < sz; ++i) { if (i >= 256) { os << ", ..."; break; } if (i > 0) { os << ", "; } os << as[i]; } return os << "]"; }
template <class T> void pv(T a, T b) { for (T i = a; i != b; ++i) cerr << *i << " "; cerr << endl; }
template <class T> bool chmin(T &t, const T &f) { if (t > f) { t = f; return true; } return false; }
template <class T> bool chmax(T &t, const T &f) { if (t < f) { t = f; return true; } return false; }


////////////////////////////////////////////////////////////////////////////////
template <unsigned M_> struct ModInt {
  static constexpr unsigned M = M_;
  unsigned x;
  constexpr ModInt() : x(0U) {}
  constexpr ModInt(unsigned x_) : x(x_ % M) {}
  constexpr ModInt(unsigned long long x_) : x(x_ % M) {}
  constexpr ModInt(int x_) : x(((x_ %= static_cast<int>(M)) < 0) ? (x_ + static_cast<int>(M)) : x_) {}
  constexpr ModInt(long long x_) : x(((x_ %= static_cast<long long>(M)) < 0) ? (x_ + static_cast<long long>(M)) : x_) {}
  ModInt &operator+=(const ModInt &a) { x = ((x += a.x) >= M) ? (x - M) : x; return *this; }
  ModInt &operator-=(const ModInt &a) { x = ((x -= a.x) >= M) ? (x + M) : x; return *this; }
  ModInt &operator*=(const ModInt &a) { x = (static_cast<unsigned long long>(x) * a.x) % M; return *this; }
  ModInt &operator/=(const ModInt &a) { return (*this *= a.inv()); }
  ModInt pow(long long e) const {
    if (e < 0) return inv().pow(-e);
    ModInt a = *this, b = 1U; for (; e; e >>= 1) { if (e & 1) b *= a; a *= a; } return b;
  }
  ModInt inv() const {
    unsigned a = M, b = x; int y = 0, z = 1;
    for (; b; ) { const unsigned q = a / b; const unsigned c = a - q * b; a = b; b = c; const int w = y - static_cast<int>(q) * z; y = z; z = w; }
    assert(a == 1U); return ModInt(y);
  }
  ModInt operator+() const { return *this; }
  ModInt operator-() const { ModInt a; a.x = x ? (M - x) : 0U; return a; }
  ModInt operator+(const ModInt &a) const { return (ModInt(*this) += a); }
  ModInt operator-(const ModInt &a) const { return (ModInt(*this) -= a); }
  ModInt operator*(const ModInt &a) const { return (ModInt(*this) *= a); }
  ModInt operator/(const ModInt &a) const { return (ModInt(*this) /= a); }
  template <class T> friend ModInt operator+(T a, const ModInt &b) { return (ModInt(a) += b); }
  template <class T> friend ModInt operator-(T a, const ModInt &b) { return (ModInt(a) -= b); }
  template <class T> friend ModInt operator*(T a, const ModInt &b) { return (ModInt(a) *= b); }
  template <class T> friend ModInt operator/(T a, const ModInt &b) { return (ModInt(a) /= b); }
  explicit operator bool() const { return x; }
  bool operator==(const ModInt &a) const { return (x == a.x); }
  bool operator!=(const ModInt &a) const { return (x != a.x); }
  friend std::ostream &operator<<(std::ostream &os, const ModInt &a) { return os << a.x; }
};
////////////////////////////////////////////////////////////////////////////////

constexpr unsigned MO = 998244353;
using Mint = ModInt<MO>;


struct Pt {
  Int x, y;
  Pt() {}
  Pt(Int x_, Int y_) : x(x_), y(y_) {}
  Pt operator+(const Pt &a) const { return Pt(x + a.x, y + a.y); }
  Pt operator-(const Pt &a) const { return Pt(x - a.x, y - a.y); }
  Pt operator*(const Pt &a) const { return Pt(x * a.x - y * a.y, x * a.y + y * a.x); }
  Pt operator+() const { return Pt(+x, +y); }
  Pt operator-() const { return Pt(-x, -y); }
  Pt operator*(const Int &k) const { return Pt(x * k, y * k); }
  Pt operator/(const Int &k) const { return Pt(x / k, y / k); }
  friend Pt operator*(const Int &k, const Pt &a) { return Pt(k * a.x, k * a.y); }
  Pt &operator+=(const Pt &a) { x += a.x; y += a.y; return *this; }
  Pt &operator-=(const Pt &a) { x -= a.x; y -= a.y; return *this; }
  Pt &operator*=(const Pt &a) { return *this = *this * a; }
  Pt &operator*=(const Int &k) { x *= k; y *= k; return *this; }
  Int abs2() const { return x * x + y * y; }
  Int dot(const Pt &a) const { return x * a.x + y * a.y; }
  Int det(const Pt &a) const { return x * a.y - y * a.x; }
  bool operator==(const Pt &a) const { return (x == a.x && y == a.y); }
  bool operator!=(const Pt &a) const { return !(*this == a); }
  bool operator<(const Pt &a) const { return (x < a.x || (x == a.x && y < a.y)); }
  friend ostream &operator<<(ostream &os, const Pt &a) { os << "(" << a.x << ", " << a.y << ")"; return os; }
};
int sig(Int r) { return (r < 0) ? -1 : (r > 0) ? +1 : 0; }
Int tri(const Pt &a, const Pt &b, const Pt &c) { return (b - a).det(c - a); }

int cmpArg(const Pt &a, const Pt &b) {
  const int sa = (a.y > 0) ? 1 : (a.y < 0) ? 3 : (a.x > 0) ? 0 : 2;
  const int sb = (b.y > 0) ? 1 : (b.y < 0) ? 3 : (b.x > 0) ? 0 : 2;
  return (sa < sb) ? -1 : (sa > sb) ? +1 : sig(b.det(a));
}

// Watch out for the case a == b.
int iSP(const Pt &a, const Pt &b, const Pt &c) {
  int s = sig((b - a).det(c - a));
  if (s) return s;
  if (sig((b - a).dot(c - a)) < 0) return -2; // c-a-b
  if (sig((a - b).dot(c - b)) < 0) return +2; //   a-b-c
  return 0;
}

// intersection = a + (numer/denom) (b - a)
pair<Int, Int> pLLRate(const Pt &a, const Pt &b, const Pt &c, const Pt &d) {
  const Pt ab = b - a, cd = d - c;
  return make_pair((c - a).det(cd), ab.det(cd));
}

bool insideWeaklyGS(const vector<Pt> &ps, const Pt &a, const Pt &b) {
  const int psLen = ps.size();
  assert(psLen >= 3);
  assert(a != b);
  const Pt ab = b - a;
  // number of intersections of ps (enlarged) and ray a-b
  int cnt = 0;
  for (int i = 0; i < psLen; ++i) {
    const Pt &p0 = ps[i];
    const Pt &p1 = ps[(i + 1 >= psLen) ? (i + 1 - psLen) : (i + 1)];
    const Pt &p2 = ps[(i + 2 >= psLen) ? (i + 2 - psLen) : (i + 2)];
    const int s0 = sig(tri(a, b, p0));
    const int s1 = sig(tri(a, b, p1));
    // in p0-p1
    if (s0 * s1 < 0) {
      const auto res = pLLRate(a, b, p0, p1);
      const Int numer = (res.second < 0) ? -res.first : res.first;
      const Int denom = (res.second < 0) ? -res.second : res.second;
      if (numer <= 0) {
      } else if (numer >= denom) {
        ++cnt;
      } else {
        return false;
      }
    }
    // at p1
    if (s1 == 0) {
      const int s2 = sig(tri(a, b, p2));
      if (s0 * s2 < 0 || (s0 != s2 && sig(tri(p0, p1, p2)) > 0)) {
        const Int numer = ab.dot(p1 - a);
        const Int denom = ab.abs2();
        if (numer <= 0) {
        } else if (numer >= denom) {
          ++cnt;
        } else {
          return false;
        }
      }
    }
  }
  return (cnt % 2 != 0);
}


int N;
vector<Pt> P;

bool can[210][210];
Mint dp[210][210];

int main() {
  for (; ~scanf("%d", &N); ) {
    P.resize(N);
    for (int i = 0; i < N; ++i) {
      scanf("%lld%lld", &P[i].x, &P[i].y);
    }
// for(int i=0;i<N;++i){for(int j=0;j<N;++j)cerr<<((i==j)?2:insideWeaklyGS(P,P[i],P[j]))<<" ";cerr<<endl;}
    
    memset(can, 0, sizeof(can));
    for (int i = 0; i < N; ++i) for (int j = i + 1; j < N; ++j) {
      if (insideWeaklyGS(P, P[i], P[j])) {
        can[i][j] = can[j][i] = true;
      }
    }
    using Dir = pair<Pt, pair<int, int>>;
    vector<Dir> dirs;
    for (int i = 0; i < N; ++i) for (int j = 0; j < N; ++j) if (can[i][j]) {
      dirs.emplace_back(P[j] - P[i], make_pair(i, j));
    }
    const int dirsLen = dirs.size();
    sort(dirs.begin(), dirs.end(), [&](const Dir &d0, const Dir &d1) -> bool {
      return (cmpArg(d0.first, d1.first) < 0);
    });
    
    memset(dp, 0, sizeof(dp));
    for (int i = 0; i < N; ++i) {
      dp[i][i] = 1;
    }
    for (int a = 0, b; a < dirsLen; a = b) {
      for (b = a + 1; b < dirsLen && cmpArg(dirs[a].first, dirs[b].first) == 0; ++b) {}
      const Pt vec = dirs[a].first;
      sort(dirs.begin() + a, dirs.begin() + b, [&](const Dir &d0, const Dir &d1) -> bool {
        return (vec.dot(P[d0.second.first]) < vec.dot(P[d1.second.first]));
      });
// pv(dirs.begin()+a,dirs.begin()+b);
      for (int c = a; c < b; ++c) {
        for (int i = 0; i < N; ++i) {
          dp[i][dirs[c].second.second] += dp[i][dirs[c].second.first];
        }
      }
    }
    
    Mint ans = 0;
    for (int i = 0; i < N; ++i) {
      ans += dp[i][i];
    }
    // 1 point
    ans -= N;
    // collinear
    for (int i = 0; i < N; ++i) for (int j = i + 1; j < N; ++j) if (can[i][j]) {
      int cnt = 0;
      for (int k = 0; k < N; ++k) if (i != k && j != k) {
        if (iSP(P[i], P[j], P[k]) == 0) {
          ++cnt;
        }
      }
      ans -= Mint(4).pow(cnt);
      ans += Mint(2).pow(cnt);
    }
    
    printf("%u\n", ans.x);
  }
  return 0;
}