#include <bits/stdc++.h>
#include <math.h>

#include <algorithm>
#include <array>
#include <atcoder/all>
#include <bitset>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <sstream>
#include <vector>

using namespace std;
using namespace atcoder;

using Graph = vector<vector<int>>;

using ll = long long;
typedef pair<ll, ll> P_ll;
typedef pair<int, int> P;

const ll INF_ll = 1e17;
const int INF = 1e8;
template <class T>
bool chmax(T& a, const T& b) {
  if (a < b) {
    a = b;
    return 1;
  }
  return 0;
}
template <class T>
bool chmin(T& a, const T& b) {
  if (b < a) {
    a = b;
    return 1;
  }
  return 0;
}
template <typename T>
using min_priority_queue = priority_queue<T, vector<T>, greater<T>>;

int main() {
  int N;
  cin >> N;
  vector<ll> A(N);
  for (int i = 0; i < N; i++) {
    cin >> A[i];
  }
  set<ll> s(A.begin(), A.end());
  map<ll, ll> d;
  int cnt = 0;
  for (auto x : s) d[x] = cnt++;

  fenwick_tree<ll> cl(N), sl(N), cr(N), sr(N);
  for (int i = 0; i < N; i++) {
    ll x = d[A[i]];
    cr.add(x, 1);
    sr.add(x, A[i]);
  }
  modint998244353 ans = 0;
  for (int i = 0; i < N; i++) {
    ll x = d[A[i]];
    {
      modint998244353 a = 1;
      a *= sr.sum(0, x);
      a *= cl.sum(x + 1, N);
      ans += a;
    }
    {
      modint998244353 a = 1;
      a *= sl.sum(x + 1, N);
      a *= cr.sum(0, x);
      ans += a;
    }
    {
      modint998244353 a = 1;
      a *= cr.sum(0, x);
      a *= cl.sum(x + 1, N);
      a *= A[i];
      ans += a;
    }
    cl.add(x, 1);
    sl.add(x, A[i]);
    cr.add(x, -1);
    sr.add(x, -A[i]);
  }
  cout << ans.val() << endl;

  return 0;
}