#include <bits/stdc++.h>
using namespace std;
typedef signed long long ll;

#define _P(...) (void)printf(__VA_ARGS__)
#define FOR(x,to) for(x=0;x<(to);x++)
#define FORR(x,arr) for(auto& x:arr)
#define FORR2(x,y,arr) for(auto& [x,y]:arr)
#define ALL(a) (a.begin()),(a.end())
#define ZERO(a) memset(a,0,sizeof(a))
#define MINUS(a) memset(a,0xff,sizeof(a))
template<class T> bool chmax(T &a, const T &b) { if(a<b){a=b;return 1;}return 0;}
template<class T> bool chmin(T &a, const T &b) { if(a>b){a=b;return 1;}return 0;}
//-------------------------------------------------------

int N;
int A[3030];
vector<int> P[3030];
const ll mo=998244353;

bitset<3032> pat[3032];
bitset<3032> did,mask;

void solve() {
	int i,j,k,l,r,x,y; string s;
	
	cin>>N;
	x=-1;
	FOR(i,N) {
		mask[i]=1;
		cin>>A[i];
		if(A[i]==N) x=i;
	}
	if(x==-1) {
		cout<<0<<endl;
		return;
	}
	rotate(A,A+x,A+N);
	FOR(i,N) pat[A[i]][i]=1;
	did=pat[N];
	ll ret=N;
	int fr=1;
	for(i=N-1;i>=1;i--) {
		int cand=0;
		FOR(j,N) {
			bitset<3032> rot=((pat[N]<<j)|(pat[N]>>(N-j)))&mask;
			if((rot&pat[i])==pat[i]) {
				if(((rot&pat[i])&(pat[i]|did))==(rot&pat[i])) {
					cand++;
				}
			}
		}
		did|=pat[i];
		ret=ret*(cand-fr)%mo;
		if(pat[i].count()==0) fr++;
	}
	cout<<ret<<endl;
	
}


int main(int argc,char** argv){
	string s;int i;
	if(argc==1) ios::sync_with_stdio(false), cin.tie(0);
	FOR(i,argc-1) s+=argv[i+1],s+='\n'; FOR(i,s.size()) ungetc(s[s.size()-1-i],stdin);
	cout.tie(0); solve(); return 0;
}