#include <stdio.h>

void add_segt (long long *t, int idx, long long val, int size, long long mod_num) {
  idx = idx+size-1;
  t[idx] += val;
  t[idx] %= mod_num;
  
  while (idx > 0) {
    idx = (idx-1)/2;
    t[idx] += val;
    t[idx] %= mod_num;
  }
  
  return;
}

long long sum_segt_rec (long long *t, int a, int b, int k, int l, int r, long long mod_num) {
  long long ans = 0LL;
  
  if (r <= a || b <= l) {
    return 0LL;
  }
  
  if (a <= l && r <= b) {
    return t[k];
  }
  
  ans = sum_segt_rec(t, a, b, 2*k+1, l, (l+r)/2, mod_num);
  ans += sum_segt_rec(t, a, b, 2*k+2, (l+r)/2, r, mod_num);
  
  return ans%mod_num;
}

long long sum_segt (long long *t, int a, int b, int size, long long mod_num) {
  return sum_segt_rec(t, a, b, 0, 0, size, mod_num);
}

int main () {
  int n = 0;
  int p[200000] = {};
  
  int res = 0;
  
  long long ans = 0LL;
  long long mod_num = 998244353LL;
  
  long long pow2[200001] = {};
  
  long long t[2][524288] = {};
  int size = 1;
  
  res = scanf("%d", &n);
  for (int i = 0; i < n; i++) {
    res = scanf("%d", p+i);
    p[i]--;
  }

  pow2[0] = 1LL;
  for (int i = 0; i < n; i++) {
    pow2[i+1] = (pow2[i]*2LL)%mod_num;
  }
  
  while (size <= n) {
    size *= 2;
  }
  
  for (int i = 0; i < n; i++) {
    ans += (sum_segt(t[0], p[i], n, size, mod_num)*pow2[n-1])%mod_num;
    ans += mod_num-(sum_segt(t[1], p[i], n, size, mod_num)*pow2[n-i-1])%mod_num;
    add_segt(t[0], p[i], 1LL, size, mod_num);
    add_segt(t[1], p[i], pow2[i], size, mod_num);
  }
  
  printf("%lld\n", ans%mod_num);
  return 0;
}