#include <bits/stdc++.h>
using namespace std;
struct Pt {
  long long x, y;
};
long long area(Pt a, Pt b, Pt c) {
  long long s = (b.x - a.x) * (c.y - a.y) - (c.x - a.x) * (b.y - a.y);
  return s;
}
bool ccw(Pt a, Pt b, Pt c) { return area(a, b, c) > 0; }
int n;
inline int next(int x) { return x + 1 == n ? 0 : x + 1; }
int main() {
  cin >> n;
  vector<Pt> pts(n);
  for (int i = 0; i < n; ++i) cin >> pts[i].x >> pts[i].y;
  long long s_area = 0;
  for (int i = 0; i < n; ++i) s_area += area({0, 0}, pts[i], pts[next(i)]);
  if (s_area < 0) reverse(pts.begin(), pts.end());
  const int MAXN = 210;
  const long long MOD = 1e9 + 7;
  static long long dp[MAXN][MAXN];
  for (int i = 0; i < n; ++i) dp[i][next(i)] = 1;
  for (int len = 2; len < n; ++len) {
    for (int i = 0; i < n; ++i) {
      int j = (i + len) % n;
      dp[i][j] = 0;
      for (int s = 1; s < len; ++s) {
        int k = (i + s) % n;
        if (ccw(pts[i], pts[k], pts[j]) > 0) {
          dp[i][j] += dp[i][k] * dp[k][j];
          dp[i][j] %= MOD;
        }
      }
    }
  }
  int ans = dp[0][n - 1] % MOD;
  cout << ans << endl;
  return 0;
}
