/*#include <iostream>
#include <map>
#include <cstdio>
#include <string>
#include <set>
#include <algorithm>
#include <vector>*/
#include <cstdio>

#define DMAX 100001
#define ll long long

using namespace std;


int n;
int a[1000024];

int main()
{
  FILE *fin = fopen("twoton.in", "r");
  FILE *fout = fopen("twoton.out", "w");
  fscanf(fin, "%d", &n);
  for (int i = 0; i < n; ++i) {
    fscanf(fin, "%d", &a[i]);
  }
  int c=1;
  int msf = a[n-1];
  for(int i= n-2; i>=0; i--)
    if(a[i] < msf) {
        c = (1 + c) % 19997;
        msf = a[i];
    }
    else c = (1 + 2*c) % 19997;
  fprintf(fout, "%d\n", c);
}