#include<bits/stdc++.h>
using namespace std;
#define LL long long
#define gc getchar
#define pb push_back
#define fi first
#define se second
#define Pair pair<int,int>
inline int read(){
	int s=0,w=1,ch=gc();
	while(ch<'0'||ch>'9'){
		if(ch=='-')w=-1;
		ch=gc();
	}
	while(ch>='0'&&ch<='9')s=s*10+ch-'0',ch=gc();
	return s*w;
}
template<int kcz>
struct ModInt {
#define T (*this)
	int x;
	ModInt() : x(0) {}
	ModInt(int y) : x(y >= 0 ? y : y + kcz) {}
	ModInt(LL y) : x(y >= 0 ? y % kcz : (kcz - (-y) % kcz) % kcz) {}
	inline int inc(const int &v) {
		return v >= kcz ? v - kcz : v;
	}
	inline int dec(const int &v) {
		return v < 0 ? v + kcz : v;
	}
	inline ModInt &operator+=(const ModInt &p) {
		x = inc(x + p.x);
		return T;
	}
	inline ModInt &operator-=(const ModInt &p) {
		x = dec(x - p.x);
		return T;
	}
	inline ModInt &operator*=(const ModInt &p) {
		x = (int)((LL)x * p.x % kcz);
		return T;
	}
	inline ModInt inverse() const {
		int a = x, b = kcz, u = 1, v = 0, t;
		while (b > 0)t = a / b, swap(a -= t * b, b), swap(u -= t * v, v);
		return u;
	}
	inline ModInt &operator/=(const ModInt &p) {
		T *= p.inverse();
		return T;
	}
	inline ModInt operator-() const {
		return -x;
	}
	inline friend ModInt operator+(const ModInt &lhs, const ModInt &rhs) {
		return ModInt(lhs) += rhs;
	}
	inline friend ModInt operator-(const ModInt &lhs, const ModInt &rhs) {
		return ModInt(lhs) -= rhs;
	}
	inline friend ModInt operator*(const ModInt &lhs, const ModInt &rhs) {
		return ModInt(lhs) *= rhs;
	}
	inline friend ModInt operator/(const ModInt &lhs, const ModInt &rhs) {
		return ModInt(lhs) /= rhs;
	}
	inline bool operator==(const ModInt &p) const {
		return x == p.x;
	}
	inline bool operator!=(const ModInt &p) const {
		return x != p.x;
	}
	ModInt qpow(LL n) const {
		ModInt ret(1), mul(x);
		while (n > 0) {
			if (n & 1)ret *= mul;
			mul *= mul, n >>= 1;
		}
		return ret;
	}
	inline friend ostream &operator<<(ostream &os, const ModInt &p) {
		return os << p.x;
	}
	inline friend istream &operator>>(istream &is, ModInt &a) {
		LL t;
		is >> t, a = ModInt<kcz>(t);
		return is;
	}
	static int get_mod() {
		return kcz;
	}
#undef T
};
const int kcz=998244353;
using Z = ModInt<kcz>;
const int N=50+10;
LL f[N][N][N][N],pre[N];
int p[N];
inline void solve(){
	int n;
	while(scanf("%d",&n)==1){
		for(int i=1;i<=n;i++)p[i]=read();
		for(int i=0;i<=n+1;i++)for(int j=0;j<=n+1;j++)for(int k=0;k<=n+1;k++)for(int l=0;l<=n+1;l++)f[i][j][k][l]=0;
		for(int len=1;len<=n;len++){
			for(int l=1,r=l+len-1;r<=n;l++,r++){
				for(int k=l;k<=r;k++){
					f[l][r][k][k]++;
					if(k!=l){
						for(int i=l;i<k;i++){
							for(int j=l;j<k;j++){
								if(p[j]<p[k])f[l][r][i][k]+=f[l][k-1][i][j];
							}
						}
					}
					if(k!=r){
						for(int i=k+1;i<=r;i++){
							for(int j=k+1;j<=r;j++){
								if(p[j]<p[k])f[l][r][i][k]+=f[k+1][r][i][j];
							}
						}
					}
					if(k!=l&&k!=r){
						for(int i=0;i<=n+1;i++)pre[i]=0;
						for(int i=k+1;i<=r;i++){
							for(int j=k+1;j<=r;j++){
								if(p[j]<p[k])pre[p[i]]+=f[k+1][r][i][j];
							}
						}
						for(int i=1;i<=n;i++)pre[i]+=pre[i-1];
						for(int i=l;i<k;i++){
							for(int j=l;j<k;j++){
								if(p[j]<p[k]){
									f[l][r][i][k]+=f[l][k-1][i][j]*(pre[n]-pre[p[j]]);
								}
							}
						}
					}
				}
			}
		}
		LL ans=0;
		for(int i=1;i<=n;i++)for(int j=1;j<=n;j++)ans+=f[1][n][i][j];
		printf("%lld\n",ans);
	}
}
int main(){
	int T=1;
	while(T--)solve();
	return 0;
}