#include <bits/stdc++.h>
using namespace std;
const int maxn = 200 + 5;
const int mod = 1000000007;
int N;
struct Point {
  int x, y;
  Point(int x = 0, int y = 0) : x(x), y(y) {}
  long long operator*(const Point &b) const {
    return (long long)x * b.y - (long long)y * b.x;
  }
  Point operator-(const Point &b) const { return Point(x - b.x, y - b.y); }
  inline void scan() const { scanf("%d%d", &x, &y); }
} P[maxn];
long long dp[maxn][maxn];
long long solve(int l, int r) {
  if (~dp[l][r]) return dp[l][r];
  long long &ans = dp[l][r];
  ans = 0;
  if (r - l == 1) return ans = 1;
  for (int i = l + 1; i < r; i++)
    if ((P[l] - P[r]) * (P[i] - P[r]) > 0)
      (ans += (solve(l, i) * solve(i, r)) % mod) %= mod;
  return ans;
}
int main() {
  scanf("%d", &N);
  long long t = 0;
  for (int i = 1; i <= N; i++) P[i].scan();
  P[N + 1] = P[1];
  for (int i = 1; i <= N; i++) t += P[i] * P[i + 1];
  if (t < 0) reverse(P + 1, P + 1 + N);
  memset(dp, -1, sizeof dp);
  printf("%I64d", solve(1, N));
  return 0;
}
