#include <bits/stdc++.h>
using namespace std;
struct Point {
  long long x, y;
  Point(long long _x = 0, long long _y = 0) : x(_x), y(_y) {}
  void read() { scanf("%I64d%I64d", &x, &y); }
};
Point operator-(Point a, Point b) { return Point(a.x - b.x, a.y - b.y); }
long long Cross(Point a, Point b) { return a.x * b.y - a.y * b.x; }
const int N = 222;
const int MOD = (int)1e9 + 7;
int n, dp[N][N];
Point dot[N];
void add(int &a, int b) {
  a += b;
  if (a >= MOD) {
    a -= MOD;
  }
}
int work(int l, int r) {
  if (r - l <= 1) return 1;
  if (dp[l][r] != -1) return dp[l][r];
  int ret = 0;
  for (int i = l + 1; i < r; i++) {
    if (Cross(dot[i] - dot[l], dot[r] - dot[l]) < 0) {
      add(ret, (long long)work(l, i) * work(i, r) % MOD);
    }
  }
  return dp[l][r] = ret;
}
int main() {
  scanf("%d", &n);
  for (int i = 0; i < n; i++) {
    dot[i].read();
  }
  long long sum = 0;
  for (int i = 0; i < n; i++) {
    sum += Cross(dot[i], dot[(i + 1) % n]);
  }
  if (sum > 0) {
    reverse(dot, dot + n);
  }
  memset(dp, -1, sizeof(dp));
  printf("%d\n", work(0, n - 1));
  return 0;
}
