#include using namespace std; typedef long long ll; #define ALL(x) (x).begin(), (x).end() #ifdef LOCAL #include "debug.hpp" #else #define debug(...) void(0) #endif template istream& operator>>(istream& is, vector& v) { for (T& x : v) is >> x; return is; } template ostream& operator<<(ostream& os, const vector& v) { for (size_t i = 0; i < v.size(); i++) { os << v[i] << (i + 1 == v.size() ? "" : " "); } return os; } template T gcd(T x, T y) { return y != 0 ? gcd(y, x % y) : x; } template T lcm(T x, T y) { return x / gcd(x, y) * y; } int topbit(signed t) { return t == 0 ? -1 : 31 - __builtin_clz(t); } int topbit(long long t) { return t == 0 ? -1 : 63 - __builtin_clzll(t); } int botbit(signed a) { return a == 0 ? 32 : __builtin_ctz(a); } int botbit(long long a) { return a == 0 ? 64 : __builtin_ctzll(a); } int popcount(signed t) { return __builtin_popcount(t); } int popcount(long long t) { return __builtin_popcountll(t); } bool ispow2(int i) { return i && (i & -i) == i; } long long MSK(int n) { return (1LL << n) - 1; } template T ceil(T x, T y) { assert(y >= 1); return (x > 0 ? (x + y - 1) / y : x / y); } template T floor(T x, T y) { assert(y >= 1); return (x > 0 ? x / y : (x - y + 1) / y); } template inline bool chmin(T1& a, T2 b) { if (a > b) { a = b; return true; } return false; } template inline bool chmax(T1& a, T2 b) { if (a < b) { a = b; return true; } return false; } template void mkuni(vector& v) { sort(v.begin(), v.end()); v.erase(unique(v.begin(), v.end()), v.end()); } template int lwb(const vector& v, const T& x) { return lower_bound(v.begin(), v.end(), x) - v.begin(); } const int INF = (1 << 30) - 1; const long long IINF = (1LL << 60) - 1; const int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1}; const int MOD = 998244353; // const int MOD = 1000000007; #include #include "atcoder/modint" namespace atcoder { template std::istream& operator>>(std::istream& is, static_modint& x) { int64_t v; x = static_modint{(is >> v, v)}; return is; } template std::ostream& operator<<(std::ostream& os, const static_modint& x) { return os << x.val(); } template std::ostream& operator<<(std::ostream& os, const dynamic_modint& x) { return os << x.val(); } } // namespace atcoder #include "atcoder/fenwicktree" using mint = atcoder::modint998244353; int main() { cin.tie(0); ios::sync_with_stdio(false); int N; cin >> N; vector P(N); for (int& x : P) cin >> x, x--; if (N == 1) { cout << 0 << '\n'; return 0; } mint ans = 0; atcoder::fenwick_tree ft_sum(N), ft_cnt(N); for (int i = 0; i < N; i++) { int x = P[i]; mint sum = ft_sum.sum(x, N), cnt = ft_cnt.sum(x, N); ans += (mint(2).pow(i) * cnt - sum) * mint(2).pow(N - 1 - i); ft_sum.add(x, mint(2).pow(i)); ft_cnt.add(x, 1); } cout << ans << '\n'; return 0; }