#include <stdio.h>
#include <vector>
#include <algorithm>
#define MOD 998244353

struct segTree{
	int value[800010];
	void setValue(int ind, int val, int l=1, int r=200000, int v=1)
	{
		if(l==r) value[v] = val;
		else
		{
			int h = (l+r)/2;
			if(ind<=h) setValue(ind,val,l,h,2*v);
			else setValue(ind,val,h+1,r,2*v+1);
			value[v] = value[2*v] + value[2*v+1];
		}
	}
	
	int getSum(int L, int R, int l=1, int r=200000, int v=1)
	{
		if(L<=l&&r<=R) return value[v];
		else if(r<L) return 0;
		else if(R<l) return 0;
		else
		{
			int h = (l+r)/2;
			int s1 = getSum(L,R,l,h,2*v);
			int s2 = getSum(L,R,h+1,r,2*v+1);
			return s1+s2;
		}
	}
}T;

int x[200010];
std::vector< std::pair<int,int> > V;
int main()
{
	int a;
	scanf("%d",&a);
	for(int i=1;i<=a;i++) scanf("%d",&x[i]);
	
	for(int i=1;i<=a;i++) V.push_back(std::make_pair(x[i],i));
	std::sort(V.begin(),V.end());
	int L = a+1, R = 0;
	
	long long int ans = 1;
	for(int i=0;i<V.size();i++)
	{
		int t = V[i].second;
		
		if(L<=t&&t<=R)
		{
			int val = (R-L+1) - T.getSum(L,R);
			ans *= val, ans %= MOD;
		}
		L = L<t?L:t;
		R = R>t?R:t;
		T.setValue(t,1);
	}
	
	printf("%lld",ans);
	
}