We have a string $S$. Initially, $S=$ `1`.
Process $Q$ queries in the following formats in order.
* `1 x` : Append a digit $x$ at the end of $S$.
* `2` : Delete the digit at the beginning of $S$.
* `3` : Print the number represented by $S$ in decimal, modulo $998244353$.
## Constraints
* $1 \leq Q \leq 6 \times 10^5$
* For each query in the first format, $x \in {1,2,3,4,5,6,7,8,9}$.
* A query in the second format is given only if $S$ has a length of $2$ or greater.
* There is at least one query in the third format.
## Input
The input is given from Standard Input in the following format:
$Q$
$\mathrm{query}_1$
$\vdots$
$\mathrm{query}_Q$
Here, $\mathrm{query}_i$ denotes the $i$\-th query, which is in one of the following formats:
$1$ $x$
$2$
$3$
[samples]