#include <bits/stdc++.h>
using namespace std;
struct node {
  long long x, y;
  node() {}
  node(double _x, double _y) : x(_x), y(_y) {}
  void read() { scanf("%I64d%I64d", &x, &y); }
  long long operator%(const node &a) const { return x * a.y - a.x * y; }
  node operator-(const node &a) const { return node(x - a.x, y - a.y); }
} a[301], tmp[301];
int n;
long long sum, f[301][301];
int main() {
  scanf("%d", &n);
  for (int i = 1; i <= n; i++) a[i].read();
  a[n + 1] = a[1];
  for (int i = 1; i <= n; i++) sum += a[i] % a[i + 1];
  if (sum < 0) {
    for (int i = 1; i <= n; i++) tmp[i] = a[n - i + 1];
    for (int i = 1; i <= n; i++) a[i] = tmp[i];
    a[n + 1] = a[1];
  }
  for (int i = 1; i < n; i++) f[i][i + 1] = 1;
  for (int i = 1; i <= n; i++)
    for (int j = 1; i + j - 1 <= n; j++)
      for (int k = j + 1; k < i + j - 1; k++)
        if ((a[i + j - 1] - a[j]) % (a[i + j - 1] - a[k]) > 0)
          f[j][i + j - 1] =
              (f[j][i + j - 1] + f[j][k] * f[k][i + j - 1]) % 1000000007;
  printf("%I64d\n", f[1][n]);
}
