#include<cstdio>
#include<vector>
#define k 1000000000000

using namespace std;
long long C[105][105];
long long C2[105][105];


long double comb2(long long a,long long b) {
if (C2[a][b]!=0) return C2[a][b];
if (b==0) {C2[a][b]=1;return 1;}
if (a==b) {C2[a][b]=1;return 1;}
C2[a][b]=(long long)comb2(a-1,b-1)*a/b;
return C2[a][b];
}

long double T2(vector<int>a) {
if (a.size()<2) return 1;
vector<int>a1;
vector<int>a2;
for(int i=1;i<a.size();i++)
 if (a[i]<a[0]) a1.push_back(a[i]);
 else a2.push_back(a[i]);
return comb2(a1.size()+a2.size(),a1.size())*T2(a1)*T2(a2);
}

long long comb(long long a,long long b) {
if (C[a][b]!=0) return C[a][b];
if (b==0) {C[a][b]=1;return 1;}
if (a==b) {C[a][b]=1;return 1;}
C[a][b]=(comb(a-1,b-1)*a/b)%k;
return (C[a][b])%k;
}

long long T(vector<int>a) {
if (a.size()<2) return 1;
vector<int>a1;
vector<int>a2;
for(int i=1;i<a.size();i++)
 if (a[i]<a[0]) a1.push_back(a[i]);
 else a2.push_back(a[i]);
return comb(a1.size()+a2.size(),a1.size())%k*T(a1)%k*T(a2)%k;
}

vector<int> pole;
int main() {
int n;

while(scanf("%d",&n) && (n>0)) {
	pole.clear();
	int x;
	for(int i=0;i<n;i++) { scanf("%d",&x);pole.push_back(x);}

	long double vys2=T2(pole);
	if (vys2/k>=1) printf("%.0llf",vys2/k);
	long long vys=T(pole);
	printf("%lld\n",vys);


}
}