#include<iostream>
#include<fstream>
using namespace std;
long n,a[1000024];
long long count,i;
long long  M = 19997;


int main(void){
  ifstream fin("twoton.in");
  ofstream fout("twoton.out");
  fin>>n;
  for(i=0;i<n;i++){
    fin>>a[i];
  }
  long long minn=a[n-1];
  count=1;
  for(i=n-2;i>=0;i--){
    if(a[i]<minn){
      count=(count+1)%M;
    }else{
      count=(2*count+1)%M;
    }
  }
  fout<<count<<'\n';
  fout.close();
  fin.close();
  return 0;
}