#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <vector>
#include <queue>
#include <stack>
#include <cmath>

using namespace std;

const int MAXN = 100 + 10;
const int MOD = 1000000007;

int n, a[MAXN];
int f[MAXN][MAXN][MAXN];

int add(int &x, int y)
{
	x = (x + y) % MOD;
}

int main()
{
	ios::sync_with_stdio(false);
	// freopen("1.in", "r", stdin);
	// freopen("1.out", "w", stdout);

	cin >> n;
	for(int i = 1; i <= 2 * n - 1; i++)
		cin >> a[i];
	sort(a + 1, a + 2 * n);
	f[n][1][1] = 1;
	for(int i = n; i >= 2; i--)
		for(int j = 1; j <= 2 * (n - i) + 1; j++)
			for(int k = 1; k <= 2 * (n - i) + 1; k++)
				if(f[i][j][k])
				{
					int jj = j + (a[i] != a[i - 1]) + (a[2 * n - i] != a[2 * n - i + 1]);
					int kk = k + (a[i] != a[i - 1]);
					add(f[i - 1][jj][kk], f[i][j][k]);
					for(int l = 1; l <= kk - 1; l++)
						add(f[i - 1][jj - (kk - l - 1)][l], f[i][j][k]);
					for(int l = kk + 1; l <= jj; l++)
						add(f[i - 1][jj - (l - kk - 1)][kk + 1], f[i][j][k]);
				}
	int ans = 0;
	for(int i = 1; i <= 2 * n - 1; i++)
		for(int j = 1; j <= 2 * n - 1; j++)
			if(f[1][i][j])
				add(ans, f[1][i][j]);
	cout << ans << endl;

	return 0;
}
