#include <bits/stdc++.h>
using namespace std;
using ll=long long;
const ll ILL=2167167167167167167;
const int INF=2100000000;
#define rep(i,a,b) for (int i=(int)(a);i<(int)(b);i++)
#define all(p) p.begin(),p.end()
template<class T> using _pq = priority_queue<T, vector<T>, greater<T>>;
template<class T> int LB(vector<T> &v,T a){return lower_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> int UB(vector<T> &v,T a){return upper_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> bool chmin(T &a,T b){if(b<a){a=b;return 1;}else return 0;}
template<class T> bool chmax(T &a,T b){if(a<b){a=b;return 1;}else return 0;}
template<class T> void So(vector<T> &v) {sort(v.begin(),v.end());}
template<class T> void Sore(vector<T> &v) {sort(v.begin(),v.end(),[](T x,T y){return x>y;});}
bool yneos(bool a,bool upp=false){if(a){cout<<(upp?"YES\n":"Yes\n");}else{cout<<(upp?"NO\n":"No\n");}return a;}
template<class T> void vec_out(vector<T> &p,int ty=0){
    if(ty==2){cout<<'{';for(int i=0;i<(int)p.size();i++){if(i){cout<<",";}cout<<'"'<<p[i]<<'"';}cout<<"}\n";}
    else{if(ty==1){cout<<p.size()<<"\n";}for(int i=0;i<(int)(p.size());i++){if(i) cout<<" ";cout<<p[i];}cout<<"\n";}}
template<class T> T vec_min(vector<T> &a){assert(!a.empty());T ans=a[0];for(auto &x:a) chmin(ans,x);return ans;}
template<class T> T vec_max(vector<T> &a){assert(!a.empty());T ans=a[0];for(auto &x:a) chmax(ans,x);return ans;}
template<class T> T vec_sum(vector<T> &a){T ans=T(0);for(auto &x:a) ans+=x;return ans;}
int pop_count(long long a){int res=0;while(a){res+=(a&1),a>>=1;}return res;}
template<class T> T square(T a){return a * a;}

#include <atcoder/modint>
using mint = atcoder::modint998244353;

void solve();
// CITRUS CURIO CITY / FREDERIC
int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int t = 1;
    // cin >> t;
    rep(i, 0, t) solve();
}

void solve(){
    int N;
    cin >> N;
    vector<int> A(N);
    vector<vector<int>> G(N);
    rep(i, 0, N) cin >> A[i], A[i]--, G[A[i]].push_back(i);
    if (G[N - 1].empty()){
        cout << "0\n";
        return;
    }
    {
        int root = G[N - 1][0];
        vector<int> B(N);
        rep(i, 0, N) G[i].clear();
        rep(i, 0, N) B[i] = A[(i + root) % N], G[B[i]].push_back(i);
        swap(A, B);
    }
    vector P(N, vector<int>(N));
    vector Q(N, N - 1);
    rep(i, 0, N){
        for (auto x : G[N - 1]){
            chmin(Q[i], A[(x + i) % N]);
            P[A[i]][(i - x + N) % N]++;
        }
    }
    vector<int> R(N);
    rep(i, 0, N) R[Q[i]]++;
    mint ans = N;
    int tmp = 0;
    for (int i = N - 1; i >= 0; i--){
        tmp += R[i];
        if (i == N - 1){
            tmp--;
        }
        else if (!G[i].empty()){
            tmp--;
            int Z = 0;
            rep(j, 0, N) if (P[i][j] == (int)G[i].size() && Q[j] == i){
                Z++;
            }
            ans *= Z;
        }
        else{
            ans *= tmp;
            tmp--;
        }
    }
    cout << ans.val() << "\n";
}