#include <fstream>
#include <iostream>
#include <list>
#include <algorithm> 

using namespace std;

ifstream in("twoton.in");
ofstream out("twoton.out");
/*int n, a[10], cnt;
int w(int i)
{
	cnt++;
	if (i == n - 1) return a[i];
	if (a[i] < w(i + 1)) return a[i];
	else
		return w(i + 1);
}*/
int main()
{
	long i, n;
	long *a;
	a = new long[100001];
	in >> n;
	for (i = 0; i < n; ++i)
		in >> a[i];
	long long cnt = 1;
	long min = a[n - 1];
	if (n!=1)
	for (i = n - 2; i>=0 ; --i)
	{
		if (a[i] < min)
		{
			min = a[i];
			cnt = cnt + 1;
		}
		else
		{
			cnt = cnt * 2 + 1;
		}
		cnt %= 19997;
	}
	out << cnt<<endl;
	return 0;

}