#include <bits/stdc++.h>
using namespace std;
const long long mod = 1e9 + 7;
const int N = 205;
struct Point {
  long long x, y;
  Point() {}
  Point(long long x, long long y) : x(x), y(y) {}
  void read() { scanf("%lld%lld", &x, &y); }
} p[N];
Point operator-(const Point &a, const Point &b) {
  return Point(a.x - b.x, a.y - b.y);
}
long long operator*(const Point &a, const Point &b) {
  return a.x * b.y - a.y * b.x;
}
int n;
long long dp[N][N];
void pre_init() {
  scanf("%d", &n);
  for (int i = 0; i < n; i++) p[i].read();
  memset(dp, -1, sizeof(dp));
  long long tmp = 0;
  p[n] = p[0];
  for (int i = 0; i < n; i++) {
    tmp += p[i] * p[i + 1];
  }
  if (tmp < 0) reverse(p, p + n);
}
long long dfs(int l, int r) {
  if (dp[l][r] != -1) return dp[l][r];
  long long &ans = dp[l][r];
  ans = 0;
  if (r - l == 1) return ans = 1;
  for (int i = l + 1; i < r; i++) {
    if ((p[l] - p[r]) * (p[i] - p[r]) > 0) {
      ans = (ans + dfs(l, i) * dfs(i, r) % mod) % mod;
    }
  }
  return ans;
}
int main() {
  pre_init();
  cout << dfs(0, n - 1) << endl;
}
