#include <bits/stdc++.h> 

const int N = , Mod = ;

int f[N][N][];

int A[N];

int main() {

    int n;

    std:: cin >> n;

    for(int i = ; i <= n; i ++) std:: cin >> A[i];

    for(int i = ; i <= n; i ++) f[i][i][] = ; //f[i][i][0] = 1;

    for(int Len = ; Len <= n; Len ++) {

        for(int i = ; i <= n; i ++) {

            int j = i + Len - ;

            if(j > n) continue;

            if(A[i] < A[i + ]) f[i][j][] = (f[i][j][] + f[i + ][j][]) % Mod;

            if(A[i] < A[j]) f[i][j][] = (f[i][j][] + f[i + ][j][]) % Mod;

            if(A[j] > A[j - ]) f[i][j][] = (f[i][j][] + f[i][j - ][]) % Mod;

            if(A[j] > A[i]) f[i][j][] = (f[i][j][] + f[i][j - ][]) % Mod;

        }

    }

    std:: cout << (f[][n][] + f[][n][]) % Mod;

    return ;

}