#include<cmath>
#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
#include<cstdlib>
#define maxn 1010
#define mod 19650827
using namespace std;
int f[maxn][maxn][2],n,a[maxn];
int main(){
    freopen("chorusu.in","r",stdin);
    freopen("chorusu.out","w",stdout);
	scanf("%d",&n);
	for(int i=1;i<=n;i++)scanf("%d",&a[i]),f[i][i][0]=1;
	for(int i=n-1;i>=1;i--){
		for(int j=i+1;j<=n;j++){
			if(a[i]<a[i+1])f[i][j][0]=(f[i][j][0]+f[i+1][j][0])%mod;
			if(a[i]<a[j])f[i][j][0]=(f[i][j][0]+f[i+1][j][1])%mod;
			if(a[j]>a[j-1])f[i][j][1]=(f[i][j][1]+f[i][j-1][1])%mod;
			if(a[j]>a[i])f[i][j][1]=(f[i][j][1]+f[i][j-1][0])%mod;
		}
	}
	printf("%d\n",(f[1][n][0]+f[1][n][1])%mod);
    return 0;
}