#include <bits/stdc++.h>
using namespace std;
const int N = 205;
const int MOD = 1000000007;
int n, dp[N][N];
pair<long long, long long> p[N];
long long cross(pair<long long, long long> a, pair<long long, long long> b,
                pair<long long, long long> c) {
  return (b.first - a.first) * (c.second - a.second) -
         (b.second - a.second) * (c.first - a.first);
}
long long dist(pair<long long, long long> a, pair<long long, long long> b,
               pair<long long, long long> c) {
  return (b.first - a.first) * (c.first - a.first) +
         (b.second - a.second) * (c.second - a.second);
}
long long s(long long x) { return x < 0 ? -1 : (x > 0 ? 1 : 0); }
bool does_intersect(pair<long long, long long> a, pair<long long, long long> b,
                    pair<long long, long long> c, pair<long long, long long> d,
                    bool& flag) {
  long long v1 = s(cross(a, b, c)) * s(cross(a, b, d)),
            v2 = s(cross(c, d, a)) * s(cross(c, d, b));
  flag |= (v1 == 0 && v2 <= 0) || (v1 <= 0 && v2 == 0);
  return v1 < 0 && v2 < 0;
}
bool lies_on_segment(pair<long long, long long> a, pair<long long, long long> b,
                     pair<long long, long long> c) {
  return cross(a, b, c) == 0 && dist(a, b, c) >= 0 &&
         dist(a, b, c) <= dist(a, b, b);
}
bool point_in_polygon(pair<long long, long long> a) {
  for (int x = 0; x < n; x++)
    if (lies_on_segment(p[x], p[(x + 1) % n], a)) return false;
  int cnt = 0, z = 0;
  bool flag = false;
  do {
    z++;
    flag = false;
    cnt = 0;
    for (int i = 0; i < n; i++) {
      if (does_intersect(a, make_pair(4e8, 4e8 + z), p[i], p[(i + 1) % n],
                         flag)) {
        cnt++;
      }
    }
  } while (flag);
  return cnt % 2 == 1;
}
bool tmp;
int main() {
  while (cin >> n) {
    for (int i = 0; i < n; i++) {
      cin >> p[i].first >> p[i].second;
      p[i].first *= 2;
      p[i].second *= 2;
    }
    for (int gap = 1; gap < n; gap++)
      for (int i = 0; i < n - gap; i++) {
        int j = i + gap;
        if (i + 1 == j) {
          dp[i][j] = 1;
        } else {
          bool ok = true;
          dp[i][j] = 0;
          for (int x = 0; x < n; x++)
            if (x != i && x != j && lies_on_segment(p[i], p[j], p[x]))
              ok = false;
          for (int x = 0; x < n; x++)
            if (does_intersect(p[i], p[j], p[x], p[(x + 1) % n], tmp))
              ok = false;
          if ((i != 0 || j != n - 1) &&
              !point_in_polygon(make_pair((p[i].first + p[j].first) / 2,
                                          (p[i].second + p[j].second) / 2)))
            ok = false;
          if (ok) {
            for (int k = i + 1; k <= j - 1; k++) {
              dp[i][j] = (dp[i][j] + ((long long)dp[i][k]) * dp[k][j]) % MOD;
            }
          }
        }
      }
    cout << dp[0][n - 1] << endl;
  }
}
