#include<bits/stdc++.h>
#if __has_include(<atcoder/all>)
#include<atcoder/modint>
#include<atcoder/lazysegtree>
#endif
using namespace std;
#define LL(...) ll __VA_ARGS__;lin(__VA_ARGS__)
#define RDVL(T,n,...) vec<T>__VA_ARGS__;fe(refs(__VA_ARGS__),e)e.get().resizes(n);lin(__VA_ARGS__)
#define VL(n,...) RDVL(ll,n,__VA_ARGS__)
#define fo(i,...) for(auto[i,i##stop,i##step]=for_range<ll>(0,__VA_ARGS__);i<i##stop;i+=i##step)
#define fe(a,e,...) for(auto&&__VA_OPT__([)e __VA_OPT__(,__VA_ARGS__]):a)
#define defpp template<ostream&o=cout>void pp(const auto&...a){[[maybe_unused]]const char*c="";((o<<c<<a,c=" "),...);o<<'\n';}void epp(const auto&...a){pp<cerr>(a...);}
#define entry defpp void main();void main2();}int main(){my::io();my::main();}namespace my{
#define use_ml998244353 using ml=atcoder::modint998244353;
namespace my{
auto&operator<<(ostream&o,const atcoder::modint998244353&x){return o<<(int)x.val();}
void io(){cin.tie(nullptr)->sync_with_stdio(0);cout<<fixed<<setprecision(15);}
using ll=long long;
constexpr auto refs(auto&...a){return array{ref(a)...};}
template<class T>constexpr auto for_range(T s,T b){T a=0;if(s)swap(a,b);return array{a-s,b,1-s*2};}
void lin(auto&...a){(cin>>...>>a);}
template<class...A>using pack_back_t=tuple_element_t<sizeof...(A)-1,tuple<A...>>;
}
namespace my{
template<class V>istream&operator>>(istream&i,vector<V>&v){fe(v,e)i>>e;return i;}
template<class V>constexpr int depth=0;
template<class T>struct core_t_helper{using type=T;};
template<class T>using core_t=core_t_helper<T>::type;
template<class V>struct vec;
template<int D,class T>struct hvec_helper{using type=vec<typename hvec_helper<D-1,T>::type>;};
template<class T>struct hvec_helper<0,T>{using type=T;};
template<int D,class T>using hvec=hvec_helper<D,T>::type;
template<class V>struct vec:vector<V>{
  static constexpr int D=depth<V>+1;
  using C=core_t<V>;
  using vector<V>::vector;
  void resizes(const auto&...a){if constexpr(sizeof...(a)==D)*this=make(a...,C{});else{ }}
  static auto make(ll n,const auto&...a){
    if constexpr(sizeof...(a)==1)return vec<C>(n,array{a...}[0]);
    else { }
  }
  ll size()const{return vector<V>::size();}
  auto iota()const{vec<int>r(size());std::iota(r.begin(),r.end(),0);return r;}
  template<class F=less<>>auto stable_sort(F f={})const{vec v=*this;ranges::stable_sort(v,f);return v;}
  template<class F=less<>>auto arg_sort(F f={})const{return iota().stable_sort([&](ll i,ll j){return f((*this)[i],(*this)[j]);});}
  auto inverse_permutation()const{return arg_sort();}
  template<class F=less<>>auto zip_distinct(F f={})const{return arg_sort(f).inverse_permutation();}
  auto rev()const{vec v=*this;ranges::reverse(v);return v;}
};
template<class...A>requires(sizeof...(A)>=2)vec(const A&...a)->vec<hvec<sizeof...(A)-2,pack_back_t<A...>>>;
}
namespace my{
namespace sgt{
template<class T,auto x>T identity(){return x;}
template<class T>T identity(){return T{};}
template<class T>T add(T a,T b){return a+b;}
template<class S,class F>S mul_mapping(F f,S x){return x*f;}
template<class F>F mul_composition(F f,F g){return g*f;}
template<class T>struct lazyseg_mul_sum:atcoder::lazy_segtree<T,add<T>,identity<T>,T,mul_mapping<T,T>,mul_composition<T>,identity<T,1>>{
  using base=atcoder::lazy_segtree<T,add<T>,identity<T>,T,mul_mapping<T,T>,mul_composition<T>,identity<T,1>>;
  lazyseg_mul_sum(const vec<T>&a):base(vec<T>(a.size(),1)){}
};
}
}
namespace my{entry
void main(){
  LL(N);
  VL(N,A);
  auto rank=A.zip_distinct(); // 同じ値も順序づけ
  use_ml998244353
  ml inv2=ml(1)/2;
  // cnt(l,r,x)=#{i|l<=i<=r \land a[i]<x}
  // \sum_{i=0}^{N-1} a[i] * \sum_{l=0}^i 2^{cnt(l,i,a[i])} * \sum_{r=i}^{N-1} 2^{cnt(i,r,a[i])}
  auto calc=[&](const vec<int>&rank){
    sgt::lazyseg_mul_sum<ml>s(vec<ml>(N,1));
    vec<ml>res(N);
    fe(rank.arg_sort(),i){
      res[i]=s.get(i).inv()*s.prod(0,i+1);
      s.apply(i+1,N,inv2);
    }
    return res;
  };

  ml ans=0;
  vec<ml>l=calc(rank);
  vec<ml>r=calc(rank.rev()).rev();
  fo(i,N)ans+=A[i]*l[i]*r[i];
  pp(ans);
}}