#include<cstdio>#include<cstring>#include<cctype>#include<algorithm>using namespace std;#define rep(i,s,t) for(int i=s;i<=t;i++)#define dwn(i,s,t) for(int i=s;i>=t;i--)#define clr(x,c) memset(x,c,sizeoF(x))int read(){    int x=0;char c=getchar();    while(!isdigit(c)) c=getchar();    while(isdigit(c)) x=x*10+c-‘0‘,c=getchar();    return x;} const int nmax=1e3+5;const int mod=19650827;int dp[nmax][nmax][2],a[nmax];int main(){    int n=read();    rep(i,1,n) a[i]=read(),dp[i][i][0]=1;    rep(j,1,n-1) {        for(int i=1;i+j<=n;i++){            dp[i][i+j][0]=((a[i]<a[i+1])*dp[i+1][i+j][0]+(a[i]<a[i+j])*dp[i+1][i+j][1])%mod;            dp[i][i+j][1]=((a[i+j]>a[i])*dp[i][i+j-1][0]+(a[i+j]>a[i+j-1])*dp[i][i+j-1][1])%mod;        }    }    printf("%d\n",(dp[1][n][0]+dp[1][n][1])%mod);    return 0;}