#include <bits/stdc++.h>
using namespace std;
const int N = 205;
const int P = 1000000007;
int n;
long long dp[N][N];
long long x[N], y[N];
long long cross(int k, int i, int j) {
  return (x[i] - x[k]) * (y[j] - y[k]) - (y[i] - y[k]) * (x[j] - x[k]);
}
int solve(int k, int l, int r) {
  long long ans = cross(k, l, r);
  if (ans > 0) return 1;
  if (ans < 0) return -1;
  return 0;
}
bool Judge(int l, int r, int i, int j) {
  int A = solve(l, i, j);
  int B = solve(r, i, j);
  int C = solve(i, l, r);
  int D = solve(j, l, r);
  if (A == 0 && B == 0 && C == 0 && D == 0) return 0;
  return A * B <= 0 && C * D <= 0;
}
bool Judge(int l, int r) {
  long long sum = 0;
  for (int i = l; i <= r - 1; i++) sum += cross(l, i, i + 1);
  if (sum <= 0) return 0;
  sum = 0;
  for (int i = r; i != l; i = i % n + 1) sum += cross(l, i, i % n + 1);
  if (sum <= 0) return 0;
  for (int i = 1; i <= n; i++) {
    int j = i % n + 1;
    if (i == l || i == r) continue;
    if (j == l || j == r) continue;
    if (Judge(l, r, i, j)) return 0;
  }
  return 1;
}
int main() {
  cin >> n;
  for (int i = 1; i <= n; i++) cin >> x[i] >> y[i];
  long long sum = 0;
  for (int i = 2; i <= n - 1; i++) sum += cross(1, i, i + 1);
  if (sum < 0) {
    reverse(x + 1, x + n + 1);
    reverse(y + 1, y + n + 1);
  }
  for (int i = 1; i <= n - 1; i++) dp[i][i + 1] = 1;
  for (int d = 2; d <= n - 2; d++)
    for (int i = 1; i <= n - d; i++)
      if (Judge(i, i + d)) {
        int j = i + d;
        for (int k = i + 1; k <= j - 1; k++)
          (dp[i][j] += dp[i][k] * dp[k][j]) %= P;
      }
  long long ans = 0;
  for (int k = 2; k <= n - 1; k++) (ans += dp[1][k] * dp[k][n]) %= P;
  cout << ans << endl;
  return 0;
}
