#include<bits/stdc++.h>
#pragma GCC optimize(3)
#pragma GCC optimize("Ofast")
#pragma GCC optimize("inline")
#pragma GCC optimize("-fgcse")
#pragma GCC optimize("-fgcse-lm")
#pragma GCC optimize("-fipa-sra")
#pragma GCC optimize("-ftree-pre")
#pragma GCC optimize("-ftree-vrp")
#pragma GCC optimize("-fpeephole2")
#pragma GCC optimize("-ffast-math")
#pragma GCC optimize("-fsched-spec")
#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("-falign-jumps")
#pragma GCC optimize("-falign-loops")
#pragma GCC optimize("-falign-labels")
#pragma GCC optimize("-fdevirtualize")
#pragma GCC optimize("-fcaller-saves")
#pragma GCC optimize("-fcrossjumping")
#pragma GCC optimize("-fthread-jumps")
#pragma GCC optimize("-funroll-loops")
#pragma GCC optimize("-fwhole-program")
#pragma GCC optimize("-freorder-blocks")
#pragma GCC optimize("-fschedule-insns")
#pragma GCC optimize("inline-functions")
#pragma GCC optimize("-ftree-tail-merge")
#pragma GCC optimize("-fschedule-insns2")
#pragma GCC optimize("-fstrict-aliasing")
#pragma GCC optimize("-fstrict-overflow")
#pragma GCC optimize("-falign-functions")
#pragma GCC optimize("-fcse-skip-blocks")
#pragma GCC optimize("-fcse-follow-jumps")
#pragma GCC optimize("-fsched-interblock")
#pragma GCC optimize("-fpartial-inlining")
#pragma GCC optimize("no-stack-protector")
#pragma GCC optimize("-freorder-functions")
#pragma GCC optimize("-findirect-inlining")
#pragma GCC optimize("-fhoist-adjacent-loads")
#pragma GCC optimize("-frerun-cse-after-loop")
#pragma GCC optimize("inline-small-functions")
#pragma GCC optimize("-finline-small-functions")
#pragma GCC optimize("-ftree-switch-conversion")
#pragma GCC optimize("-foptimize-sibling-calls")
#pragma GCC optimize("-fexpensive-optimizations")
#pragma GCC optimize("-funsafe-loop-optimizations")
#pragma GCC optimize("inline-functions-called-once")
#pragma GCC optimize("-fdelete-null-pointer-checks")
using namespace std;
namespace jyy{
	const int mod=998244353,N=510;
	const double eps=1e-8;
	#define ll long long
	#define ull unsigned long long
	#define mp make_pair
	#define fi first
	#define se second
	#define IN inline
	#define pi pair<int,int>
	IN int read(){
		static int x=0,f=1;x=0,f=1;
		static char ch=getchar();
		while(ch<'0'||ch>'9'){(ch=='-')?f*=-1:f;ch=getchar();}
		while(ch>='0'&&ch<='9')x=x*10+int(ch-48),ch=getchar();
		return x*f;
	}
	IN void fw(int x){if(x<0)putchar('-'),x=-x;x>=10?fw(x/10),1:0;putchar(char(x%10+48));}
}
using namespace jyy;
int n,a[N];
const int M=1145141;
struct has{
	int head[M],tot;
	bitset<M>vis;
	struct edge{ll to,num;int next;}dat[20000000];
	void insert(int x,ll y,ll z){
		vis[x]=1;
		for(int i=head[x];i;i=dat[i].next)if(dat[i].to==y)return dat[i].num+=z,void();
		dat[++tot]=(edge){y,z,head[x]},head[x]=tot;
	}
	void clear(){
		for(int i=0;i<M;i=vis._Find_next(i))head[i]=0;
		vis.reset();
		tot=0;
	}
}dp[2];
//unordered_map<ll,ll>dp[51];
void solve(){
	for(int i=1;i<=n;i++)a[i]=read();
	reverse(a+1,a+1+n);
	dp[0].clear();
	dp[0].insert(0,0,1);
	int now=0;
	ll ans=0;
	for(int i=1;i<=n;i++){
//		cout<<"check "<<dp[now].tot<<endl;
		now^=1;dp[now].clear();
		for(int j=0;j<M;j=dp[now^1].vis._Find_next(j)){
			for(int k=dp[now^1].head[j];k;k=dp[now^1].dat[k].next){
				ll A=dp[now^1].dat[k].to,w=dp[now^1].dat[k].num;
				if(i!=n){
					ll B=A;
					if(A){
						int pos=__builtin_ctzll(A);
						if(pos<a[i])B|=(1ll<<(a[i]-1));
					}
					dp[now].insert(B%M,B,w);
				}
				else if(A)ans+=w;
				if((1ull<<(a[i]-1))&A)continue;
				if(A){
					int pos=__builtin_ctzll(A);
					if(pos<a[i]){
						ll hh=((1ull<<a[i])-1)^((1ull<<(pos+1))-1);
						A|=hh;
					}
				}
				A|=(1ull<<(a[i]-1));
				for(int z=1;z<i;z++)if(a[z]>a[i])A|=(1ll<<(a[z]-1));
				if(i!=n)dp[now].insert(A%M,A,w);
				else if(A)ans+=w;
			}
		}
	}
	printf("%lld\n",ans);
//	cerr<<"clock "<<clock()<<endl;
}
int main(){
//	freopen("a.in","r",stdin);
	n=read();solve(); 
	while(scanf("%d",&n)!=EOF)solve(); 
}