#include<fstream>
#define mod 9901
#define dim 256<<1
using namespace std;


ifstream f("culori.in");
ofstream g("culori.out");
int A[dim<<1][dim<<1],i,j,k,l,v[dim],n;
int main (){
	
	f>>n;
	n=2*n-1;
	for(i=1;i<=n; ++i){
		f>>v[i];
		A[i][i]=1;
	}
	for( l =1 ;l<=n; l++  ) {
		
		for(i=1 ; i+l<n; ++i){
			
			j=i+l-1;
			if(v[i]==v[j])
				for(k=i+1 ;k<=j; k++)
					A[i][j]+=(A[i][k-1]*A[k][j])%mod;
		}
	}
 	g<<A[1][n]%mod;
	return 0;
}