#include <bits/stdc++.h>
using namespace std;
using lint = long long int;
using P = pair<int, int>;
using PL = pair<lint, lint>;
#define FOR(i, begin, end) for(int i=(begin),i##_end_=(end);i<i##_end_;i++)
#define IFOR(i, begin, end) for(int i=(end)-1,i##_begin_=(begin);i>=i##_begin_;i--)
#define REP(i, n) FOR(i,0,n)
#define IREP(i, n) IFOR(i,0,n)
#define ALL(a)  (a).begin(),(a).end()
constexpr int MOD = 1000000007;
constexpr lint B1 = 1532834020;
constexpr lint M1 = 2147482409;
constexpr lint B2 = 1388622299;
constexpr lint M2 = 2147478017;
constexpr int INF = 2147483647;
void yes(bool expr) {cout << (expr ? "Yes" : "No") << "\n";}
template<class T>void chmax(T &a, const T &b) { if (a<b) a=b; }
template<class T>void chmin(T &a, const T &b) { if (b<a) a=b; }
#include <atcoder/all>
using namespace atcoder;
using mint = modint998244353;

int main()
{
  ios::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  int N;
  cin >> N;
  vector<lint> A(N);
  REP(i, N) cin >> A[i];
  set<lint> st;
  REP(i, N) st.insert(A[i]);
  map<lint, int> mp;
  int tmp = 0;
  for(int x : st) {
    mp[x] = tmp;
    tmp++;
  }
  vector<lint> idx(N);
  REP(i, N) idx[i] = mp[A[i]];
  fenwick_tree<lint> bitl(N), bitr(N), cntl(N), cntr(N);
  REP(i, N) bitr.add(idx[i], A[i]);
  REP(i, N) cntr.add(idx[i], 1);
  mint ans = 0;
  REP(i, N) {
    lint cntll = cntl.sum(idx[i]+1, N);
    lint cntrr = cntr.sum(0, idx[i]);
    lint sumll = bitl.sum(idx[i]+1, N);
    lint sumrr = bitr.sum(0, idx[i]);
    ans += (mint)sumll * cntrr;
    ans += (mint)sumrr * cntll;
    ans += (mint)A[i] * cntrr * cntll;
    bitr.add(idx[i], -A[i]);
    cntr.add(idx[i], -1);
    bitl.add(idx[i], A[i]);
    cntl.add(idx[i], 1);
  }
  cout << ans.val() << endl;
}