#include <bits/stdc++.h>
using namespace std;
struct node {
  long long x, y;
  node(long long X = 0, long long Y = 0) { x = X, y = Y; }
};
node operator-(node a, node b) { return node(a.x - b.x, a.y - b.y); }
long long operator^(node a, node b) { return a.x * b.y - a.y * b.x; }
const int mo = 1000000007;
const int N = 205;
long long f[N][N];
node a[N];
int n;
void Init() {
  scanf("%d", &n);
  for (int i = 1; i <= n; ++i) scanf("%lld%lld", &a[i].x, &a[i].y);
}
void Changeit() {
  long long G = 0;
  for (int i = 2; i <= n; ++i) G += (a[i - 1] - a[1]) ^ (a[i] - a[1]);
  if (G < 0)
    for (int i = 1; i <= n >> 1; ++i) swap(a[i], a[n - i + 1]);
}
void Work() {
  Changeit();
  for (int i = 1; i <= n - 1; ++i) f[i][i + 1] = 1;
  for (int l = 2; l <= n - 1; ++l)
    for (int i = 1; i <= n - l; ++i) {
      int j = i + l;
      for (int k = i + 1; k <= j - 1; ++k)
        if (((a[k] - a[i]) ^ (a[j] - a[i])) > 0)
          (f[i][j] += f[i][k] * f[k][j]) %= mo;
    }
  printf("%lld\n", f[1][n]);
}
int main() {
  Init();
  Work();
  return 0;
}
