import sys

# sys.setrecursionlimit(200005)
# sys.set_int_max_str_digits(200005)
int1 = lambda x: int(x)-1
pDB = lambda *x: print(*x, end="\n", file=sys.stderr)
p2D = lambda x: print(*x, sep="\n", end="\n\n", file=sys.stderr)
def II(): return int(sys.stdin.readline())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def LI1(): return list(map(int1, sys.stdin.readline().split()))
def LLI1(rows_number): return [LI1() for _ in range(rows_number)]
def SI(): return sys.stdin.readline().rstrip()

dij = [(0, 1), (-1, 0), (0, -1), (1, 0)]
# dij = [(0, 1), (-1, 0), (0, -1), (1, 0), (1, 1), (1, -1), (-1, 1), (-1, -1)]
# inf = -1-(-1 << 31)
inf = -1-(-1 << 62)

# md = 10**9+7
md = 998244353

n=II()
aa=LI()

st=[]
s=0
ans=0
for a in aa:
    c=1
    nl=nr=a
    new=[]
    while st and (st[-1][0]>=a or st[-1][1]<=a):
        pl,pr,pc=st.pop()
        s-=pl*pr%md*pc%md
        l=min(pl,a)
        r=max(pr,a)
        if l==nl and r==nr:
            c+=pc
        else:
            new.append((nl,nr,c))
            nl,nr,c=l,r,pc
    new.append((nl,nr,c))
    while new:
        l,r,c=new.pop()
        s+=l*r%md*c%md
        st.append((l,r,c))
    s%=md
    ans+=s
    ans%=md
    # print(st)
print(ans)