#include <bits/stdc++.h>
using namespace std;
const int maxn = 200 + 10;
const int MOD = 1000 * 1000 * 1000 + 7;
struct Point {
  int x, y;
  Point(int x = 0, int y = 0) : x(x), y(y) {}
} p[maxn];
Point operator-(const Point& a, const Point& b) {
  return Point(a.x - b.x, a.y - b.y);
}
long long cross(const Point& a, const Point& b) {
  return (long long)a.x * b.y - (long long)a.y * b.x;
}
int d[maxn][maxn];
int n;
long long solve(int s, int e) {
  int& ans = d[s][e];
  if (ans != -1) return ans;
  if (s + 1 == e) return ans = 1;
  long long res = 0;
  for (int i = s + 1; i < e; ++i) {
    if (cross(p[s] - p[e], p[i] - p[e]) > 0)
      res = (res + solve(s, i) * solve(i, e)) % MOD;
  }
  return ans = res;
}
int main() {
  scanf("%d", &n);
  for (int i = 0; i < n; ++i) scanf("%d %d", &p[i].x, &p[i].y);
  long long judge = 0;
  for (int i = 0; i < n; ++i) judge += cross(p[i], p[(i + 1) % n]);
  if (judge < 0) reverse(p, p + n);
  memset(d, -1, sizeof(d));
  printf("%lld\n", solve(0, n - 1));
  return 0;
}
