#include <bits/stdc++.h>
using namespace std;
inline int read() {
  int s = 0, f = 1;
  char ch = getchar();
  while (ch < '0' || ch > '9') {
    if (ch == '-') f = -1;
    ch = getchar();
  }
  while (ch >= '0' && ch <= '9')
    s = (s << 3) + (s << 1) + ch - '0', ch = getchar();
  return s * f;
}
const int N = 205, mod = 1e9 + 7;
inline int add(int a, int b) { return (a + b) >= mod ? a + b - mod : a + b; }
inline int mul(int a, int b) { return 1ll * a * b % mod; }
struct Node {
  int x, y;
};
inline Node operator-(Node a, Node b) { return (Node){a.x - b.x, a.y - b.y}; }
inline long long operator*(Node a, Node b) {
  return 1ll * a.x * b.y - 1ll * a.y * b.x;
}
Node a[N];
int n;
bool vis[N][N];
int f[N][N];
int dp(int l, int r) {
  if (r == l + 1) return 1;
  if (vis[l][r]) return f[l][r];
  vis[l][r] = 1;
  f[l][r] = 0;
  for (int i = l + 1; i < r; ++i) {
    if ((a[i] - a[l]) * (a[r] - a[l]) > 0)
      f[l][r] = add(f[l][r], mul(dp(l, i), dp(i, r)));
  }
  return f[l][r];
}
int main() {
  n = read();
  for (int i = 1; i <= n; ++i) {
    a[i].x = read();
    a[i].y = read();
  }
  long long S = 0;
  for (int i = 2; i < n; ++i) S += (a[i] - a[1]) * (a[i + 1] - a[1]);
  if (S < 0) reverse(a + 1, a + 1 + n);
  printf("%d", dp(1, n));
  return 0;
}
