#include<bits/stdc++.h>
#include<atcoder/all>
using namespace std;
using namespace atcoder;
typedef long long int ll;
typedef long double ld;
typedef vector<ll> vi;
typedef vector<vi> vvi;
typedef vector<vvi> vvvi;
typedef vector<vvvi> vvvvi;
typedef vector<bool> vb;
typedef vector<vb> vvb;
typedef vector<vvb> vvvb;
typedef vector<vvvb> vvvvb;
typedef pair<ll,ll> pi;
typedef pair<ll,pi> ppi;
typedef pair<ll,ppi> pppi;
typedef pair<ll,pppi> ppppi;
#define FOR(i,l,r) for(ll i=l;i<r;i++)
#define REP(i,n) FOR(i,0,n)
#define RFOR(i,l,r) for(ll i=r-1;i>=l;i--)
#define RREP(i,n) RFOR(i,0,n)
#define ALL(x) x.begin(),x.end()
#define F first
#define S second
#define BS(A,x) binary_search(ALL(A),x)
#define LB(A,x) (ll)(lower_bound(ALL(A),x)-A.begin())
#define UB(A,x) (ll)(upper_bound(ALL(A),x)-A.begin())
#define COU(A,x) (UB(A,x)-LB(A,x))
#define sz(c) ((ll)(c).size())
/*
#include<boost/multiprecision/cpp_int.hpp>
namespace mp=boost::multiprecision;
using Bint=mp::cpp_int;
*/
template<typename T>using min_priority_queue=priority_queue<T,vector<T>,greater<T>>;
template<typename T1,typename T2>ostream&operator<<(ostream&os,pair<T1,T2>p){os<<p.F<<" "<<p.S;return os;}
template<typename T1,typename T2>istream&operator>>(istream&is,pair<T1,T2>&p){is>>p.F>>p.S;return is;}
template<typename T>ostream&operator<<(ostream&os,vector<T>v){REP(i,sz(v))os<<v[i]<<(i+1!=sz(v)?" ":"");return os;}
template<typename T>istream&operator>>(istream&is,vector<T>&v){for(T&in:v)is>>in;return is;}
template<class T>bool chmax(T&a,T b){if(a<b){a=b;return 1;}return 0;}
template<class T>bool chmin(T&a,T b){if(b<a){a=b;return 1;}return 0;}
ld dist(ld x1,ld y1,ld x2,ld y2){return sqrtl((x1-x2)*(x1-x2)+(y1-y2)*(y1-y2));}
vi fast_mod_convolution(vi&a,vi&b,ll mod){
  const ll m1=167772161,m2=469762049,m3=1224736769;
  const ll m1_inv_m2=inv_mod(m1,m2);
  const ll m12_inv_m3=inv_mod(m1*m2,m3);
  const ll m12_mod=m1*m2%mod;
  auto x=convolution<m1>(a,b);
  auto y=convolution<m2>(a,b);
  auto z=convolution<m3>(a,b);
  vector<ll>ret(sz(a)+sz(b)-1);
  REP(i,sz(ret)){
    ll v1=(y[i]-x[i])*m1_inv_m2%m2;if(v1<0)v1+=m2;
    ll v2=(z[i]-(x[i]+m1*v1)%m3)*m12_inv_m3%m3;if(v2<0)v2+=m3;
  	ret[i]=(x[i]+m1*v1+m12_mod*v2)%mod;
  }
  return ret;
}
const ld EPS=1e-8;
//*
using mint=modint998244353;
const ll mod=998244353;
//*/
/*
using mint=modint1000000007;
const ll mod=1000000007;
//*/
//using mint=modint;
//*
typedef vector<mint> vm;
typedef vector<vm> vvm;
typedef vector<vvm> vvvm;
typedef vector<vvvm> vvvvm;
ostream&operator<<(ostream&os,mint a){os<<a.val();return os;}
istream&operator>>(istream&is,mint&a){int x;is>>x;a=mint(x);return is;}
//*/
int main(){
  ll N;cin>>N;
  vi A(N);cin>>A;
  vi idx(N);
  iota(ALL(idx),0);
  sort(ALL(idx),[&](ll i,ll j){return A[i]<A[j];});
  lazy_segtree<pi,[](pi a,pi b){return pi((a.F+b.F)%(2*mod),a.S+b.S);},[](){return pi(0,0);},ll,[](ll f,pi x){return f==-1?x:pi(x.S*f%(2*mod),x.S);},[](ll f,ll g){return f==-1?g:f;},[](){return -1;}>LR(N),RL(N);
  REP(i,N)LR.set(i,pi(A[i],1)),RL.set(i,pi(A[i],1));
  vi L(N),R(N);
  REP(i,N)L[i]=R[i]=i;
  dsu D(N);
  mint ans=0;
  vb seen(N);
  auto LRB=[&](ll l,ll r,ll v){
    while(r-l>1){
      ll m=(l+r)/2;
      if(LR.get(m).F<v)r=m;
      else l=m;
    }
    return r;
  };
  auto RLB=[&](ll l,ll r,ll v){
    while(r-l>1){
      ll m=(l+r)/2;
      if(RL.get(m).F<v)l=m;
      else r=m;
    }
    return l;
  };
  for(auto i:idx){
    seen[i]=1;
    ll l=i,r=i;
    if(i&&seen[i-1])l=L[D.leader(i-1)];
    if(i+1<N&&seen[i+1])r=R[D.leader(i+1)];
    ll lmin=(l==i?A[i]:LR.get(i-1).F);
    ll rmin=(r==i?A[i]:RL.get(i+1).F);
    //計算パート
    mint rsum=LR.prod(i+1,r+1).F;
    mint lsum=RL.prod(l,i).F;
    mint s=A[i];
    if(i==l||i==r)s+=lsum+rsum;
    else if(i-l<r-i){
      FOR(j,l,i){
        ll t=RL.get(j).F;
        ll u=LRB(i,r+1,t);
        s+=(u-i)*t+LR.prod(u,r+1).F;
      }
      s+=rsum;
    }
    else{
      FOR(j,i+1,r+1){
        ll t=LR.get(j).F;
        ll u=RLB(l-1,i,t);
        s+=(i-u)*t+RL.prod(l,u+1).F;
      }
      s+=lsum;
    }
    ans+=A[i]*s;
    //
    D.merge(l,i);
    ll w=D.merge(r,i);
    L[w]=l;R[w]=r;
    LR.apply(i,LRB(i,r+1,lmin),lmin);
    RL.apply(RLB(l-1,i,rmin)+1,i+1,rmin);
  }
  cout<<ans<<endl;
  return 0;
}