#include <bits/stdc++.h>
using namespace std;
const int N = 207;
const int P = 1e9 + 7;
struct Node {
  int x, y;
  Node operator-(const Node &p) const { return (Node){x - p.x, y - p.y}; }
  long long operator^(const Node &p) const {
    return 1ll * x * p.y - 1ll * y * p.x;
  }
} a[N];
int n, dp[N][N];
inline void inc(int &x, int y) {
  if ((x += y) >= P) x -= P;
}
int main() {
  scanf("%d", &n);
  for (int i = (0); i < (n); ++i) scanf("%d%d", &a[i].x, &a[i].y);
  long long area = 0;
  for (int i = (0); i < (n); ++i) area += a[i] ^ a[(i + 1) % n];
  if (area > 0) reverse(a, a + n);
  for (int i = (0); i < (n - 1); ++i) dp[i][i + 1] = 1;
  for (int d = (2); d < (n); ++d)
    for (int i = (0); i < (n - d); ++i) {
      int j = i + d;
      for (int k = (i + 1); k < (j); ++k)
        if (((a[k] - a[i]) ^ (a[k] - a[j])) > 0)
          inc(dp[i][j], 1ll * dp[i][k] * dp[k][j] % P);
    }
  printf("%d\n", dp[0][n - 1]);
  return 0;
}
