#include <bits/stdc++.h>
using namespace std;
int N, F[205][205];
struct Vec {
  int x, y;
  Vec operator-(const Vec& b) { return (Vec){x - b.x, y - b.y}; }
  long long operator*(const Vec& b) { return 1ll * x * b.y - 1ll * y * b.x; }
} A[205];
int main() {
  scanf("%d", &N);
  for (int i = 1; i <= N; i++) scanf("%d%d", &A[i].x, &A[i].y);
  A[0] = A[N];
  long long S = 0;
  for (int i = 1; i <= N; i++) S += A[i] * A[i - 1];
  if (S >= 0)
    for (int i = 1; i <= N / 2; i++) swap(A[i], A[N - i + 1]);
  for (int i = 1; i <= N - 1; i++) F[i][i + 1] = 1;
  for (int l = 3; l <= N; l++)
    for (int i = 1; i <= N - l + 1; i++) {
      int j = i + l - 1;
      for (int k = i + 1; k <= j - 1; k++)
        if ((A[k] - A[i]) * (A[j] - A[i]) > 0)
          F[i][j] =
              (1ll * F[i][k] * F[k][j] % 1000000007 + F[i][j]) % 1000000007;
    }
  printf("%d\n", F[1][N]);
}
