#include <bits/stdc++.h>
#define LLI long long int
#define FOR(v, a, b) for(LLI v = (a); v < (b); ++v)
#define FORE(v, a, b) for(LLI v = (a); v <= (b); ++v)
#define REP(v, n) FOR(v, 0, n)
#define REPE(v, n) FORE(v, 0, n)
#define REV(v, a, b) for(LLI v = (a); v >= (b); --v)
#define ALL(x) (x).begin(), (x).end()
#define RALL(x) (x).rbegin(), (x).rend()
#define ITR(it, c) for(auto it = (c).begin(); it != (c).end(); ++it)
#define RITR(it, c) for(auto it = (c).rbegin(); it != (c).rend(); ++it)
#define EXIST(c,x) ((c).find(x) != (c).end())
#define fst first
#define snd second
#define popcount __builtin_popcount
#define UNIQ(v) (v).erase(unique(ALL(v)), (v).end())
#define bit(i) (1LL<<(i))

#ifdef DEBUG
#include <misc/C++/Debug.cpp>
#else
#define dump(...) ((void)0)
#endif

#define gcd __gcd

using namespace std;
template <class T> constexpr T lcm(T m, T n){return m/gcd(m,n)*n;}

template <typename I> void join(ostream &ost, I s, I t, string d=" "){for(auto i=s; i!=t; ++i){if(i!=s)ost<<d; ost<<*i;}ost<<endl;}
template <typename T> istream& operator>>(istream &is, vector<T> &v){for(auto &a : v) is >> a; return is;}
template <typename T, typename U> bool chmin(T &a, const U &b){return (a>b ? a=b, true : false);}
template <typename T, typename U> bool chmax(T &a, const U &b){return (a<b ? a=b, true : false);}
template <typename T, size_t N, typename U> void fill_array(T (&a)[N], const U &v){fill((U*)a, (U*)(a+N), v);}

struct Init{
  Init(){
    cin.tie(0);
    ios::sync_with_stdio(false);
    cout << fixed << setprecision(12);
    cerr << fixed << setprecision(12);
  }
}init;



template <std::uint32_t M> class ModInt{
public:
  std::uint64_t val;
  ModInt(): val(0){}
  ModInt(std::int64_t n){
    if(n >= M) val = n % M;
    else if(n < 0) val = n % M + M;
    else val = n;
  }
  
  inline constexpr ModInt operator+(const ModInt &a) const {return ModInt((val+a.val) % M);}
  inline constexpr ModInt operator-(const ModInt &a) const {return ModInt((val-a.val+M) % M);}
  inline constexpr ModInt operator*(const ModInt &a) const {return ModInt((val*a.val) % M);}
  inline constexpr ModInt operator/(const ModInt &a) const {return ModInt((val*a.inv().val) % M);}
  
  inline constexpr ModInt& operator=(const ModInt &a){val = a.val; return *this;}
  inline constexpr ModInt& operator+=(const ModInt &a){if((val += a.val) >= M) val -= M; return *this;}
  inline constexpr ModInt& operator-=(const ModInt &a){if(val < a.val) val += M; val -= a.val; return *this;}
  inline constexpr ModInt& operator*=(const ModInt &a){(val *= a.val) %= M; return *this;}
  inline constexpr ModInt& operator/=(const ModInt &a){(val *= a.inv().val) %= M; return *this;}

  inline constexpr bool operator==(const ModInt &a) const {return val == a.val;}
  inline constexpr bool operator!=(const ModInt &a) const {return val != a.val;}

  inline constexpr ModInt& operator++(){*this += 1; return *this;}
  inline constexpr ModInt& operator--(){*this -= 1; return *this;}

  inline constexpr ModInt operator++(int){ModInt t = *this; *this += 1; return t;}
  inline constexpr ModInt operator--(int){ModInt t = *this; *this -= 1; return t;}

  inline constexpr static ModInt frac(std::int64_t a, std::int64_t b){
    return ModInt(a) / ModInt(b);
  }
  
  inline constexpr static ModInt power(std::int64_t n, std::int64_t p){
    if(p < 0) return power(n, -p).inv();
    
    ModInt ret = 1, e = n;
    for(; p; e *= e, p >>= 1) if(p&1) ret *= e;
    return ret;
  }

  inline constexpr ModInt power(std::int64_t p) const {return power(val,p);}
  
  inline constexpr ModInt inv() const {
    std::int64_t a = val, b = M, u = 1, v = 0;
    
    while(b){
      std::int64_t t = a/b;
      a -= t*b; std::swap(a,b);
      u -= t*v; std::swap(u,v);
    }
    u %= M;
    if(u < 0) u += M;
    
    return u;
  }
};

template <std::uint32_t M> ModInt<M> operator-(const ModInt<M> &a){return M-a.val;}

template <std::uint32_t M> ModInt<M> operator+(std::int64_t a, const ModInt<M> &b){return ModInt<M>(ModInt<M>(a)+b.val);}
template <std::uint32_t M> ModInt<M> operator-(std::int64_t a, const ModInt<M> &b){return ModInt<M>(ModInt<M>(a)-b.val);}
template <std::uint32_t M> ModInt<M> operator*(std::int64_t a, const ModInt<M> &b){return ModInt<M>(ModInt<M>(a)*b.val);}
template <std::uint32_t M> ModInt<M> operator/(std::int64_t a, const ModInt<M> &b){return ModInt<M>(ModInt<M>(a)/b.val);}

template <std::uint32_t M> std::istream& operator>>(std::istream &is, ModInt<M> &a){is >> a.val; return is;}
template <std::uint32_t M> std::ostream& operator<<(std::ostream &os, const ModInt<M> &a){ os << a.val; return os;}



constexpr double eps = 1e-7;

template <typename T, typename U> bool EQ(const T &a, const U &b){return std::fabs(a-b) < eps;}
template <typename T, typename U> bool NE(const T &a, const U &b){return not EQ(a,b);}
template <typename T, typename U> bool LT(const T &a, const U &b){return a-b < -eps;}
template <typename T, typename U> bool LE(const T &a, const U &b){return a-b < eps;}
template <typename T, typename U> bool GT(const T &a, const U &b){return not LE(a,b);}
template <typename T, typename U> bool GE(const T &a, const U &b){return not LT(a,b);}

template <typename T> struct Point{
  T x, y;
  Point(): x(0), y(0){}
  Point(const T &x, const T &y): x(x), y(y){}
  T size() const {return sqrt(x*x+y*y);}
  T size_sq() const {return x*x+y*y;}
  
  static Point<T> polar(const T &r, const T &ang){return Point(r * cos(ang), r * sin(ang));}
};

template <typename T> Point<T> operator+(const Point<T> &a, const Point<T> &b){return Point<T>(a.x+b.x, a.y+b.y);}
template <typename T> Point<T> operator-(const Point<T> &a, const Point<T> &b){return Point<T>(a.x-b.x, a.y-b.y);}
template <typename T> Point<T> operator-(const Point<T> &a){return Point<T>(-a.x, -a.y);}
template <typename T, typename U> Point<T> operator*(const Point<T> &a, const U &k){return Point<T>(a.x*k, a.y*k);}
template <typename T, typename U> Point<T> operator*(const U &k, const Point<T> &a){return Point<T>(a.x*k, a.y*k);}
template <typename T, typename U> Point<T> operator/(const Point<T> &a, const U &k){return Point<T>(a.x/k, a.y/k);}
template <typename T> bool operator==(const Point<T> &a, const Point<T> &b){return EQ(a.x,b.x) and EQ(a.y,b.y);}
template <typename T> bool operator!=(const Point<T> &a, const Point<T> &b){return !(a==b);}
template <typename T> bool operator<(const Point<T> &a, const Point<T> &b){return LT(a.x,b.x) or (EQ(a.x,b.x) and LT(a.y,b.y));}
template <typename T> std::istream& operator>>(std::istream &is, Point<T> &a){is >> a.x >> a.y; return is;}
template <typename T> std::ostream& operator<<(std::ostream &os, const Point<T> &a){os << "(" << a.x << "," << a.y << ")"; return os;}
template <typename T> T dot(const Point<T> &a, const Point<T> &b){return a.x*b.x+a.y*b.y;}
template <typename T> T cross(const Point<T> &a, const Point<T> &b){return a.x*b.y-a.y*b.x;}
template <typename T> T angle(const Point<T> &a, const Point<T> &b){return atan2(b.y-a.y, b.x-a.x);} // 点aから点bへの角度
template <typename T> Point<T> unit(const Point<T> &a){return a / a.size();} // 単位ベクトル
template <typename T> Point<T> normal(const Point<T> &p){return Point<T>(-p.y,p.x);}
template <typename T> T phase(const Point<T> &a){return std::atan2(a.y, a.x);}

template <typename T>
T angle_diff(const Point<T> &a, const Point<T> &b){
  T r = phase(b) - phase(a);

  if(r < -M_PI) return r + 2 * M_PI;
  else if(r > M_PI) return r - 2 * M_PI;
  return r;
}

template <typename T> struct Line{
  Point<T> from, to;
  Line(): from(), to(){}
  Line(const Point<T> &from, const Point<T> &to): from(from), to(to){}
  Point<T> diff() const {return to-from;}
  T size() const {return diff().size();}
};

template <typename T> using Segment = Line<T>;
template <typename T> using Polygon = std::vector<Point<T>>;

template <typename T> struct Circle{
  Point<T> center;
  T radius;
  Circle(): center(), radius(0){}
  Circle(const Point<T> &center, T radius): center(center), radius(radius){}
};


namespace ccw{
  enum CCW{
           ONLINE_BACK       = -2,
           COUNTER_CLOCKWISE = -1,
           ON_SEGMENT        = 0,
           CLOCKWISE         = 1,
           ONLINE_FRONT      = 2
  };

  template <typename T>
  CCW ccw(const Point<T> &p0, const Point<T> &p1, const Point<T> &p2){
    const T cr = cross(p1-p0, p2-p0);
    const T d = dot(p1-p0, p2-p0);

    if(EQ(cr,0)){
      if(LT(d,0)) return ONLINE_BACK;
      else if(GT((p2-p0).size(),(p1-p0).size())) return ONLINE_FRONT;
      else return ON_SEGMENT;
    }else if(GT(cr,0)){
      return COUNTER_CLOCKWISE;
    }else{
      return CLOCKWISE;
    }
  }
}

using mint = ModInt<998244353>;


int main(){
  int N;
  while(cin >> N){
    vector<Point<double>> p(N); cin >> p;

    mint ans = mint::power(2, N);

    ans -= N + 1;

    REP(i,N){
      FOR(j,i+1,N){
        const auto &a = p[i], &b = p[j];

        int s = 0;
        
        for(auto c : p){
          if(c == a or c == b) continue;
          if(ccw::ccw(a, b, c) == ccw::ON_SEGMENT) ++s;
        }

        ans -= mint::power(2, s);
      }
    }

    cout << ans << endl;
  }

  return 0;
}


Measured memory_bytes: 256