#include <cstdio>
using namespace std;
int num[1111], dp[1111][1111];
int main() {
int n;
scanf("%d", &n);
for (int i = 1; i <= n; i++){
scanf("%d", num + i);
dp[i][i] = 1;
}
for (int i = 2; i <= n; i++)
for (int j = 1; i + j - 1 <= n; j++){
int k = i + j - 1;
if (num[j] < num[j + 1]) dp[k][j] += dp[k][j + 1];
if (num[j] < num[k] && j != k - 1) dp[k][j] += dp[j + 1][k];
if (num[k] > num[k - 1]) dp[j][k] += dp[j][k - 1];
if (num[k] > num[j] && j != k - 1) dp[j][k] += dp[k - 1][j];
dp[j][k] %= 19650827, dp[k][j] %= 19650827;
}
printf("%d\n", (dp[1][n] + dp[n][1]) % 19650827);
return 0;
}
