#include <bits/stdc++.h>
using namespace std;
struct point {
  double first, second;
  point() {}
  point(double _x, double _y) {
    first = _x;
    second = _y;
  }
  point operator-(const point &a) {
    return point(first - a.first, second - a.second);
  }
  double operator*(const point &a) {
    return first * a.second - second * a.first;
  }
};
long mod = 1000 * 1000 * 1000 + 7, n;
long long d[301][301];
point v[301];
void init() {
  double tmp = 0;
  v[n] = v[0];
  for (int i = 0; i < n; i++) tmp += v[i] * v[i + 1];
  if (tmp < 0) reverse(v, v + n);
}
long long solve(int l, int r) {
  if (d[l][r] != -1) return d[l][r];
  long long ans = 0;
  if (r - l == 1) return 1;
  for (int i = l + 1; i < r; i++) {
    if ((v[l] - v[r]) * (v[i] - v[r]) > 0) {
      ans = (ans + solve(l, i) * solve(i, r)) % mod;
    }
  }
  return d[l][r] = ans;
}
int main() {
  cin >> n;
  for (int i = 0; i < n; i++) {
    point t = point(1, 1);
    cin >> t.first >> t.second;
    t.first += 1000 * 1000 * 10;
    t.second += 1000 * 1000 * 10;
    v[i] = t;
  }
  for (int i = 0; i < n; i++)
    for (int j = 0; j < n; j++) d[i][j] = -1;
  init();
  cout << solve(0, n - 1);
  return 0;
}
