#include <bits/stdc++.h>
using namespace std;
const int MOD = 1000000007;
struct Vec {
  long long x, y;
  Vec(long long _x, long long _y) : x(_x), y(_y) {}
  long long operator*(const Vec &that) const { return x * that.y - y * that.x; }
  Vec operator-(const Vec &that) const { return Vec(x - that.x, y - that.y); }
};
vector<Vec> pt;
long long area(vector<Vec> &pt) {
  long long res = 0;
  for (int i = 0; i < pt.size(); i++) {
    res += pt[i] * pt[(i + 1) % pt.size()];
  }
  return res;
}
bool clock(Vec a, Vec b, Vec c) {
  b = b - a;
  c = c - a;
  return b * c < 0;
}
int n;
long long dp[211][211];
long long dpr(int l, int r) {
  long long &res = dp[l][r];
  if (res != -1)
    return res;
  else if (r - l == 1)
    return res = 1;
  res = 0;
  for (int i = l + 1; i < r; i++) {
    if (clock(pt[l], pt[r], pt[i])) {
      res += dpr(l, i) * dpr(i, r);
      res %= MOD;
    }
  }
  return res;
}
void input() {
  scanf("%d", &n);
  for (int i = 0; i < n; i++) {
    int x, y;
    scanf("%d%d", &x, &y);
    pt.push_back(Vec(x, y));
  }
}
void solve() {
  if (area(pt) < 0) reverse(pt.begin(), pt.end());
  memset(dp, -1, sizeof(dp));
  printf("%I64d\n", dpr(0, n - 1));
}
int main() {
  input();
  solve();
}
