#include <bits/stdc++.h>
using namespace std;
const int MOD = 1000000007;
const int MAXN = 205;
int N;
complex<long long> P[MAXN];
long long dp[MAXN][MAXN];
long long cross_prod(complex<long long> p1, complex<long long> p2) {
  return imag(conj(p1) * p2);
}
long long getdp(int a, int b) {
  if (b - a == 1) return dp[a][b] = 1;
  if (dp[a][b] != -1) return dp[a][b];
  dp[a][b] = 0;
  for (int i = a + 1; i < b; i++)
    if (cross_prod(P[a] - P[i], P[b] - P[i]) < 0)
      dp[a][b] = (dp[a][b] + getdp(a, i) * getdp(i, b)) % MOD;
  return dp[a][b];
}
int main() {
  cin >> N;
  for (int i = 0; i < N; i++) {
    int x, y;
    cin >> x >> y;
    P[i] = complex<long long>(x, y);
  }
  long long area = 0;
  for (int i = 0; i < N; i++) area += cross_prod(P[i], P[(i + 1) % N]);
  if (area < 0) reverse(P, P + N);
  memset(dp, -1, sizeof(dp));
  cout << getdp(0, N - 1) << "\n";
  return 0;
}
