#include<bits/stdc++.h> #define int long long using namespace std; int m = 1e9 + 7; int n,a[114],dp[114][114]; struct st { int x; int y; } xy[6666]; bool cmp (st a,st b) { return a.y < b.y; } signed main () { freopen("c.in","r",stdin); freopen("c.out","w",stdout); cin >> n; for (int i = 1;i <= n;i++) { cin >> xy[i].x >> xy[i].y; } sort(xy + 1,xy + n + 1,cmp); for (int i = 1;i <= n;i++) { a[i] = xy[i].x; } for (int i = 1;i <= n;i++) { dp[0][i] = 1; } for (int i = 0;i <= n;i++) { for (int j = i + 1;j <= n;j++) { for (int k = j + 1;k <= n;k++) { if (i == 0) { dp[j][k]++; } else if ((a[i] <= a[k] && a[k] <= a[j]) || (a[j] <= a[k] && a[k] <= a[i])) { dp[j][k] += dp[i][j]; } dp[j][k] %= m; } } } int ans = 0; for (int i = 0;i <= n;i++) { for (int j = 1;j <= n;j++) { ans += dp[i][j]; ans %= m; } } cout << ans; return 0; }