#include <bits/stdc++.h>
using namespace std;
const int Size = 210;
const long long Mod = 1000000007;
struct Point {
  long long X, Y;
  long long operator*(const Point& A) const { return X * A.Y - A.X * Y; }
  Point operator-(const Point& A) const {
    Point P;
    P.X = X - A.X, P.Y = Y - A.Y;
    return P;
  }
};
int N;
Point P[Size];
long long F[Size][Size];
void Init() {
  scanf("%d", &N);
  memset(F, -1, sizeof(F));
  for (int i = 0; i < N; ++i) scanf("%I64d%I64d", &P[i].X, &P[i].Y);
  P[N] = P[0];
  long long Tmp = 0;
  for (int i = 0; i < N; ++i) Tmp += P[i] * P[i + 1];
  if (Tmp < 0) reverse(P, P + N);
}
long long DP(int L, int R) {
  if (F[L][R] != -1) return F[L][R];
  long long& Res = F[L][R];
  Res = 0;
  if (R - L == 1) return Res = 1;
  for (int i = L + 1; i < R; ++i) {
    if ((P[L] - P[R]) * (P[i] - P[R]) > 0)
      Res = (Res + DP(L, i) * DP(i, R)) % Mod;
  }
  return Res;
}
int main() {
  Init();
  printf("%I64d\n", DP(0, N - 1));
}
