#include <bits/stdc++.h>
using namespace std;
int n;
long long dp[210][210];
struct point {
  long long x, y;
  void read() { scanf("%I64d%I64d", &x, &y); }
} P[210];
long long cross(point a, point b, point c) {
  return (b.x - a.x) * (c.y - a.y) - (b.y - a.y) * (c.x - a.x);
}
int main() {
  long long s = 0;
  scanf("%d", &n);
  for (int i = 1; i <= n; i++) P[i].read();
  P[n + 1] = P[1];
  for (int i = 2; i <= n; i++) s += cross(P[1], P[i], P[i + 1]);
  if (s > 0)
    for (int i = 1; i <= n / 2; i++) swap(P[i], P[n - i + 1]);
  for (int i = 1; i < n; i++) dp[i][i + 1] = 1;
  for (int i = 2; i < n; i++)
    for (int j = 1; j <= n - i; j++)
      for (int k = j + 1; k < i + j; k++)
        if (cross(P[j], P[i + j], P[k]) > 0)
          dp[j][i + j] = (dp[j][i + j] + dp[j][k] * dp[k][i + j]) % 1000000007;
  printf("%I64d", dp[1][n]);
}
