#include <bits/stdc++.h>
using namespace std;
const long long mod = 1e9 + 7;
struct st {
  double x, y;
} a[201];
int n;
long long f[201][201];
double s;
st operator-(st a, st b) {
  st c;
  c.x = a.x - b.x;
  c.y = a.y - b.y;
  return c;
}
double operator*(st a, st b) { return a.x * b.y - a.y * b.x; }
int main() {
  cin >> n;
  for (int i = 1; i <= n; i++) {
    cin >> a[i].x >> a[i].y;
    if (i > 1) s += a[i - 1] * a[i];
  }
  s += a[n] * a[1];
  if (s > 0)
    for (int i = 1; i <= n / 2; i++) swap(a[i], a[n - i + 1]);
  for (int i = 1; i < n; i++) f[i][i + 1] = 1;
  for (int l = 3; l <= n; l++) {
    for (int i = 1; i <= n - l + 1; i++) {
      int j = i + l - 1;
      for (int k = i + 1; k < j; k++)
        if ((a[j] - a[i]) * (a[k] - a[i]) > 0)
          f[i][j] = (f[i][j] + f[i][k] * f[k][j]) % mod;
    }
  }
  cout << f[1][n];
}
