#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <algorithm>
#include <vector>

using namespace std;

#define file_in "culori.in"
#define file_out "culori.out"

#define nmax (1<<8)+1

int n;
int c[nmax];
int a[nmax][nmax];

void citire()
{
    freopen(file_in,"r",stdin);
    freopen(file_out,"w",stdout);

    scanf("%d", &n);
    for (int i=0;i<2*n-1;++i)
         scanf("%d", &c[i]);

}

#define mod 9901

void solve()
{
     int i,j,k,l;

     n=2*n-1;
     for (i=0;i<n;++i)
          a[i][i]=1;

     for (l=2;l<n;++l)
     {
         for (i=0;i<n-l;++i)
           {
               j=i+l;
                if (c[i]==c[j])
                {
                for (k=i;k<j;++k)
                    {
                         a[i][j]+=a[i][k]*a[k+1][j-1];
                         if (a[i][j]>=mod)
                             a[i][j]%=mod;
                             k++;
                     }
                }

           }
           l++;
     }
     printf("%d\n", a[0][n-1]);

}

int main()
{
    citire();
    solve();

    fclose(stdin);
    fclose(stdout);

    return 0;
}