#include <bits/stdc++.h>
using namespace std;
const int maxn = 200 + 10;
const int mod = 1e9 + 7;
typedef struct Point {
  long long x, y;
  Point(long long x = 0, long long y = 0) : x(x), y(y) {}
  Point operator-(const Point& p) const { return Point(x - p.x, y - p.y); }
  long long operator*(const Point& p) { return x * p.y - y * p.x; }
} P;
P p[maxn];
long long dp[maxn][maxn];
int main(void) {
  int n;
  cin >> n;
  for (int i = 0; i < n; i++) scanf("%lld%lld", &p[i].x, &p[i].y);
  long long d = 0;
  for (int i = 0; i < n; i++) d += p[i] * p[(i + 1) % n];
  if (d < 0) reverse(p, p + n);
  for (int i = 0; i < n; i++) dp[i][i + 1] = 1;
  for (int len = 2; len < n; len++) {
    for (int l = 0; l + len < n; l++) {
      int r = l + len;
      for (int k = l + 1; k < r; k++) {
        if ((p[k] - p[l]) * (p[l] - p[r]) < 0)
          dp[l][r] = (dp[l][r] + (dp[l][k] * dp[k][r]) % mod) % mod;
        else
          continue;
      }
    }
  }
  cout << dp[0][n - 1] << endl;
}
