#include <iostream>
#include <fstream>
#include <algorithm>
#include <vector>
#include <string>
#include <map>
#include <cstdio>
#include <climits>
#include <cassert>
using namespace std;

ifstream fin("permutation.txt");
#define cin fin

unsigned int solve( const vector<bool>& P )
{
  const int NA = P.size() + 1;

  vector< vector<unsigned int> > N( NA, vector<unsigned int>(NA, 0) );

  N[0][0] = 1;
  for (int i = 1; i <= P.size(); ++i) {
    unsigned int sum = 0;
    if(P[i - 1])
      for (int j = 0; j <= i; ++j) {
        N[i][j] = sum;
        sum += N[i - 1][j];
      }
    else {
      N[i][i] = 0;
      for (int j = i - 1; j >= 0; --j)
        N[i][j] = sum += N[i - 1][j];
    }
  }

#if 0
  cout << "---" << endl;
  for (int i = 0; i <= P.size(); ++i) {
    for (int j = 0; j <= i; ++j) {
      cout << N[i][j] << ' ';
    }
    cout <<endl;
  }
  cout << "---" << endl;
#endif
  
  unsigned int sum = 0;
  for (int i = 0; i <= P.size(); ++i) {
    sum += N[P.size()][i];
  }
  return sum;
}

int main()
{
  if(!fin) return -1;

  for(int N; cin>>N,N; )
    {
      vector<int> A;
      while( N-- )
        {
          int a; cin >> a;
          A.push_back(a);
        }

      vector<bool> P;
      for(int i=0; i+1!=A.size(); ++i)
        P.push_back( A[i] < A[i+1] );
      cout << solve(P) << endl;
    }
  return 0;
}