#include <bits/stdc++.h>
using namespace std;
const int mod = 1000000007;
struct point {
  long long x, y;
  point() {}
  point(long long _x, long long _y) {
    x = _x;
    y = _y;
  }
  long long operator^(const point &b) const { return x * b.y - y * b.x; }
  point operator-(const point &b) const { return point(x - b.x, y - b.y); }
} p[210];
long long dp[210][210];
long long dfs(int l, int r) {
  if (dp[l][r] >= 0) return dp[l][r];
  if (l == r - 1) return 1;
  long long res = 0;
  for (int i = l + 1; i < r; i++) {
    if (((p[l] - p[r]) ^ (p[i] - p[l])) > 0) {
      res = (res + dfs(l, i) * dfs(i, r) % mod) % mod;
    }
  }
  return dp[l][r] = res;
}
int n;
int main() {
  scanf("%d", &n);
  for (int i = 0; i < n; i++) scanf("%I64d%I64d", &p[i].x, &p[i].y);
  long long s = 0;
  for (int i = 0; i < n; i++) s += p[i] ^ p[(i + 1) % n];
  if (s < 0) reverse(p, p + n);
  memset(dp, -1, sizeof(dp));
  long long ans = dfs(0, n - 1);
  printf("%I64d\n", ans);
}
