#include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include using namespace std; using namespace atcoder; typedef long long ll; #define rep(i, n) for (int i = 0; i < (int)(n); i++) #define repr(i, n) for (int i = (int)(n) - 1; i >= 0; i--) #define repk(i, k, n) for (int i = k; i < (int)(n); i++) #define all(v) v.begin(), v.end() #define mod1 1000000007 #define mod2 998244353 #define mod3 100000007 #define vi vector #define vs vector #define vc vector #define vl vector #define vb vector #define vvi vector> #define vvc vector> #define vvl vector> #define vvb vector> #define vvvi vector>> #define vvvl vector>> #define pii pair #define pil pair #define pli pair #define pll pair #define vpii vector> #define vpll vector> #define vvpii vector>> #define vvpll vector>> template void debug(T e) { cerr << e << endl; } template void debug(vector &v) { rep(i, v.size()) { cerr << v[i] << " "; } cerr << endl; } template void debug(vector> &v) { rep(i, v.size()) { rep(j, v[i].size()) { cerr << v[i][j] << " "; } cerr << endl; } } template void debug(vector> &v) { rep(i, v.size()) { cerr << v[i].first << " " << v[i].second << endl; } } template void debug(set &st) { for (auto itr = st.begin(); itr != st.end(); itr++) { cerr << *itr << " "; } cerr << endl; } template void debug(multiset &ms) { for (auto itr = ms.begin(); itr != ms.end(); itr++) { cerr << *itr << " "; } cerr << endl; } template void debug(map &mp) { for (auto itr = mp.begin(); itr != mp.end(); itr++) { cerr << itr->first << " " << itr->second << endl; } } void debug_out() { cerr << endl; } template void debug_out(Head H, Tail... T) { cerr << H << " "; debug_out(T...); } using mint = modint998244353; void debug_mint1(vector &vec) { for (int i = 0; i < vec.size(); i++) { cerr << vec[i].val() << " "; } cerr << endl; } void debug_mint2(vector> &vec) { for (int i = 0; i < vec.size(); i++) { for (int j = 0; j < vec[i].size(); j++) { cerr << vec[i][j].val() << " "; } cerr << endl; } } ll op(ll a, ll b) { return a + b; } ll e() { return 0LL; } int main() { vector fact(300003); fact[0] = mint(1); for (ll i = 0; i < 300002; i++) { fact[i + 1] = fact[i] * mint(i + 1); } vector finv(300003); for (ll i = 0; i < 300003; i++) { finv[i] = mint(1) / fact[i]; } auto comb = [&fact, &finv](ll n, ll r) -> mint { if (r < 0) { return mint(0); } if (n < r) { return mint(0); } return fact[n] * finv[n - r] * finv[r]; }; ll N; cin >> N; vector P(N); for (ll i = 0; i < N; i++) { cin >> P[i]; P[i]--; } vector invs(N); for (ll i = 0; i < N; i++) { invs[P[i]] = i; } mint ans = mint(0); segtree seg(N); for (ll i = 0; i < N; i++) { ll left_under = seg.prod(0, invs[i]); ll right_under = seg.prod(invs[i] + 1, N); ll left_over = invs[i] - left_under; ll right_over = (N - invs[i] - 1) - right_under; mint prod = comb(left_under + right_over, left_under); prod *= comb(left_over + right_under, left_over); ans += prod; seg.set(invs[i], 1); // debug_out(left_under, right_under, left_over, right_over); } cout << ans.val() << endl; }