Given is a sequence of $N$ integers: $A = (A_1, A_2, \dots, A_N)$. Find the number of (not necessarily contiguous) subsequences $A'=(A'_1,A'_2,\ldots,A'_k)$ of length at least $2$ that satisfy the following condition: - $A'_1 \leq A'_k$. Since the count can be enormous, print it modulo $998244353$. Here, two subsequences are distinguished when they originate from different sets of indices, even if they are the same as sequences.

Input is given from Standard Input in the following format: >$N$ >$A_1$ $A_2$ $\ldots$ $A_N$ #### Constraints - $2 \leq N \leq 3 \times 10^5$ - $1 \leq A_i \leq 10^9$ - All values in input are integers.

Print the number of (not necessarily contiguous) subsequences $A'=(A'_1,A'_2,\ldots,A'_k)$ of length at least $2$ that satisfy the condition in Problem Statement.

AtCoder [ABC221E]