#include <bits/stdc++.h>

using namespace std;

const long long MOD = 998244353;

template <typename T>
class fenwick_tree {
  vector<T> data;
public:
  fenwick_tree() {}
  // manage data in [1, n]
  fenwick_tree(int n) : data(n + 1) {}

  void init() {
    fill(data.begin(), data.end(), 0);
  }

  // return sum in [1, i]
  T sum(int i){
    T s = 0;
    while(i > 0){
      s += data[i];
      s %= MOD;
      i -= i & -i;
    }
    return s;
  }

  // return sum in [l, r]
  T sum(int l, int r) {
    return (sum(r) - sum(l-1) + MOD) % MOD;
  }
  
  void add(int i, T x){
    while(i < (int)data.size()){
      data[i] += x;
      data[i] %= MOD;
      i += i & -i;
    }
  }
};

int calc(int x) {
  return x * x;
}

int calc(int x, int y) {
  return x * y;
}


int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);

  int n;
  cin >> n;

  vector<long long> a(n);
  for (int i = 0; i < n; i++)
    cin >> a[i];

  vector<long long> zip = a;
  sort(zip.begin(), zip.end());
  zip.erase(unique(zip.begin(), zip.end()), zip.end());

  int m = zip.size();
  long long ret = 0;
  fenwick_tree<long long> cnt1(m), cnt2(m);
  fenwick_tree<long long> sum1(m), sum2(m);

  for (int i = 0; i < n; i++) {
    int b = lower_bound(zip.begin(), zip.end(), a[i]) - zip.begin() + 1;

    cnt1.add(b, 1);
    sum1.add(b, a[i]);

    long long t = cnt1.sum(b+1, m) * a[i] % MOD + sum1.sum(b+1, m) % MOD;
    t %= MOD;

    cnt2.add(b, cnt1.sum(b+1, m));
    cnt2.add(b, 0);

    sum2.add(b, t);

    ret += cnt2.sum(b+1, m) * a[i] % MOD + sum2.sum(b+1, m);
    ret %= MOD;
    
  }
  cout << ret << endl;
  
  return 0;
}