/* -*- coding: utf-8 -*-
 *
 * 1300.cc:  No.1300 Sum of Inversions - yukicoder
 */

#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<iostream>
#include<string>
#include<vector>
#include<map>
#include<set>
#include<stack>
#include<list>
#include<queue>
#include<deque>
#include<algorithm>
#include<numeric>
#include<utility>
#include<complex>
#include<functional>
 
using namespace std;

/* constant */

const int MAX_N = 200000;
const int MOD = 998244353;

/* typedef */

typedef long long ll;

struct Elm {
  int a, c;
  Elm(): a(0), c(0) {}
  Elm(int _a, int _c): a(_a), c(_c) {}

  Elm &operator+=(const Elm e) {
    a = (a + e.a) % MOD;
    c = (c + e.c) % MOD;
    return *this;
  }

  Elm operator*(const int v) const {
    return Elm((a + (ll)v * c % MOD) % MOD, c);
  }

  Elm operator-(const Elm e) const {
    return Elm((a + MOD - e.a) % MOD, (c + MOD - e.c) % MOD);
  }
};

template <typename T, const int MAX_N>
struct BIT {
  int n;
  T bits[MAX_N + 1], z;
  BIT() {}

  void init(int _n, T _z) {
    n = _n; z = _z;
    //memset(bits, 0, sizeof(bits));
  }

  T sum(int x) {
    T s = z;
    while (x > 0) {
      s += bits[x];
      x -= (x & -x);
    }
    return s;
  }

  void add(int x, T v) {
    while (x <= n) {
      bits[x] += v;
      x += (x & -x);
    }
  }
};

/* global variables */

int as[MAX_N], uas[MAX_N];
BIT<Elm,MAX_N> bit0, bit1;

/* subroutines */

/* main */

int main() {
  int n;
  scanf("%d", &n);

  for (int i = 0; i < n; i++)
    scanf("%d", as + i), uas[i] = as[i];
  sort(uas, uas + n);
  int m = unique(uas, uas + n) - uas;

  bit0.init(m, Elm()), bit1.init(m, Elm());

  Elm sum;
  for (int i = 0; i < n; i++) {
    int k = lower_bound(uas, uas + m, as[i]) - uas;

    Elm e0 = bit0.sum(m) - bit0.sum(k + 1);
    bit0.add(k + 1, Elm(as[i], 1));

    Elm e1 = bit1.sum(m) - bit1.sum(k + 1);
    bit1.add(k + 1, e0 * as[i]);

    sum += e1 * as[i];
  }

  printf("%d\n", sum.a);
  return 0;
}