#include<bits/stdc++.h>
using namespace std;
int n, f[1001][1001], g[1001][1001], a[1001];
const int mod=19650827;
int main(){
	cin>> n;
	for(int i=1;i<=n;i++) cin>> a[i];
	for(int i=1;i<=n;i++) f[i][i]=1;
	for(int i=n;i>=1;i--)
		for(int j=i+1;j<=n;j++){
			if(a[i]<a[i+1]) f[i][j]=(f[i+1][j]+f[i][j])%mod;
			else if(a[i]<a[j]) f[i][j]=	(g[i+1][j]+f[i][j])%mod;
			else if(a[i]<a[j]) g[i][j]=(g[i][j]+f[i][j-1])%mod;
			else if(a[j]>a[j-1]) g[i][j]=(g[i][j]+g[i][j-1])%mod;
		}
	cout<<(f[1][n]+g[1][n])%mod;
	return 0;
}