#include <bits/stdc++.h>
using namespace std;
const int MAXN = 205, MOD = 1e9 + 7;
struct point {
  long long x, y;
  point() {}
  point(long long _x, long long _y) : x(_x), y(_y) {}
  friend point operator-(const point a, const point b) {
    return point(a.x - b.x, a.y - b.y);
  }
  friend long long operator*(const point a, const point b) {
    return a.x * b.y - a.y * b.x;
  }
} pts[MAXN];
int n;
bool vis[MAXN][MAXN];
long long f[MAXN][MAXN];
long long dp(int l, int r) {
  if (vis[l][r]) return f[l][r];
  vis[l][r] = true;
  long long& res = f[l][r];
  if (l == r - 1) return res = 1;
  for (int k = l + 1; k < r; ++k)
    if ((pts[r] - pts[l]) * (pts[r] - pts[k]) > 0) {
      res += dp(l, k) * dp(k, r);
      res %= MOD;
    }
  return res;
}
int main() {
  cin >> n;
  for (int i = 0; i < n; ++i) cin >> pts[i].x >> pts[i].y;
  pts[n] = pts[0];
  long long area = 0;
  for (int i = 0; i < n; ++i) area += pts[i] * pts[i + 1];
  if (area < 0) reverse(pts, pts + n), pts[n] = pts[0];
  cout << dp(0, n - 1) << endl;
}
