# include <cstdio>

# include <cstring>

# include <cstdlib>

# include <iostream>

# include <vector>

# include <queue>

# include <stack>

# include <map>

# include <set>

# include <cmath>

# include <algorithm>

using namespace std;

# define lowbit(x) ((x)&(-x))

# define pi 3.1415926535

# define eps 1e-

# define MOD

# define INF

# define mem(a,b) memset(a,b,sizeof(a))

# define FOR(i,a,n) for(int i=a; i<=n; ++i)

# define FO(i,a,n) for(int i=a; i<n; ++i)

# define bug puts("H");

# define lch p<<,l,mid

# define rch p<<|,mid+,r

# define mp make_pair

# define pb push_back

typedef pair<int,int> PII;

typedef vector<int> VI;

# pragma comment(linker, "/STACK:1024000000,1024000000")

typedef long long LL;

int Scan() {

    int res=, flag=;

    char ch;

    if((ch=getchar())=='-') flag=;

    else if(ch>=''&&ch<='') res=ch-'';

    while((ch=getchar())>=''&&ch<='')  res=res*+(ch-'');

    return flag?-res:res;

}

void Out(int a) {

    if(a<) {putchar('-'); a=-a;}

    if(a>=) Out(a/);

    putchar(a%+'');

}

const int N=;

//Code begin...

int dp[][N][N], a[N];

int dfs(int mark, int l, int r){

    if (~dp[mark][l][r]) return dp[mark][l][r];

    if (l==r) return dp[mark][l][r]=;

    int res=;

    if (mark) {

        if (a[l]<a[r]) res+=dfs(,l,r-);

        if (r-!=l&&a[r-]<a[r]) res+=dfs(,l,r-);

    }

    else {

        if (a[r]>a[l]) res+=dfs(,l+,r);

        if (l+!=r&&a[l+]>a[l]) res+=dfs(,l+,r);

    }

    return dp[mark][l][r]=res%MOD;

}

int main ()

{

    mem(dp,-);

    int n;

    scanf("%d",&n);

    FOR(i,,n) scanf("%d",a+i);

    printf("%d\n",(dfs(,,n)+dfs(,,n))%MOD);

    return ;

}