#include <iostream>
#include <sstream>
#include <algorithm>
#include <cstdio>
#include <cmath>
#include <set>
#include <map>
#include <queue>
#include <string>
#include <cstring>
#include <bitset>
#include <functional>
#include <random>
#define REP(i,a,n) for(int i=a;i<=n;++i)
#define PER(i,a,n) for(int i=n;i>=a;--i)
#define hr putchar(10)
#define pb push_back
#define lc (o<<1)
#define rc (lc|1)
#define mid ((l+r)>>1)
#define ls lc,l,mid
#define rs rc,mid+1,r
#define x first
#define y second
#define io std::ios::sync_with_stdio(false)
#define endl '\n'
#define DB(a) ({REP(__i,1,n) cout<<a[__i]<<' ';hr;})
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
const int P = 1e9+7, INF = 0x3f3f3f3f;
ll gcd(ll a,ll b) {return b?gcd(b,a%b):a;}
ll qpow(ll a,ll n) {ll r=1%P;for (a%=P;n;a=a*a%P,n>>=1)if(n&1)r=r*a%P;return r;}
ll inv(ll x){return x<=1?1:inv(P%x)*(P-P/x)%P;}
inline int rd() {int x=0;char p=getchar();while(p<'0'||p>'9')p=getchar();while(p>='0'&&p<='9')x=x*10+p-'0',p=getchar();return x;}
//head



const int N = 200;
int n, a[N], dp[2][N][N];

void add(int &a, int b) {a+=b;if (a>=P) a-=P;}

int main() {
	scanf("%d", &n);
	int m = 2*n-1;
	REP(i,1,m) scanf("%d", a+i);
	sort(a+1,a+1+m);
	int cur = 0;
	dp[0][0][0] = 1;
	PER(i,1,n-1) {
		cur ^= 1;
		memset(dp[cur],0,sizeof dp[0]);
		int l = a[i]!=a[i+1], r = a[2*n-i-1]!=a[2*n-i];
		REP(j,0,m) REP(k,0,m) {
			int &ret = dp[!cur][j][k];
			if (!ret) continue;
			//b[i]=b[i+1]
			add(dp[cur][j+l][k+r],ret);
			//b[i]<b[i+1]
			REP(t,0,j+l-1) add(dp[cur][t][k+r+1],ret);
			//b[i]>b[i+1]
			REP(t,0,k+r-1) add(dp[cur][j+l+1][t],ret);
		}
	}
	int ans = 0;
	REP(i,0,m) REP(j,0,m) add(ans,dp[cur][i][j]);
	printf("%d\n", ans);
}






