#include <bits/stdc++.h>
const int N = 200 + 5;
const int Mod = 1e9 + 7;
inline int Get() {
  char ch;
  int Num, Sign = 0;
  while ((ch = getchar()) < '0' || ch > '9')
    if (ch == '-') Sign ^= 1;
  Num = ch - '0';
  while ((ch = getchar()) >= '0' && ch <= '9')
    Num = (Num << 3) + (Num << 1) + ch - '0';
  return Sign ? -Num : Num;
}
int n, x[N], y[N], g[N][N];
double sum;
struct node {
  double x, y;
  inline node(){};
  inline node(double a, double b) { x = a, y = b; }
  inline double friend operator*(const node &a, const node &b) {
    return a.x * b.y - b.x * a.y;
  }
  inline node friend operator-(const node &a, const node &b) {
    return node(a.x - b.x, a.y - b.y);
  }
} a[N];
int main() {
  n = Get();
  for (int i = 0; i < n; ++i) a[i].x = Get(), a[i].y = Get();
  for (int i = 0; i < n; ++i) sum += a[i] * a[(i + 1) % n];
  if (sum < 0)
    for (int i = 0; i * 2 < n; ++i) std ::swap(a[i], a[n - i - 1]);
  for (int len = 1; len < n; ++len)
    for (int l = 0; l < n; ++l) {
      int r = l + len;
      if (r >= n) break;
      if (len == 1) g[l][r] = 1;
      for (int k = l + 1; k < r; ++k)
        if ((a[l] - a[r]) * (a[k] - a[r]) > 0)
          (g[l][r] += (long long)g[l][k] * g[k][r] % Mod) %= Mod;
    }
  printf("%d\n", g[0][n - 1]);
}
