{"raw_statement":[{"iden":"problem statement","content":"For a positive integer $X$ none of whose digits is $0$, consider obtaining a positive integer $Y$ as follows.\n\n*   Initialize $S$ as an empty string.\n*   Let $N$ be the number of digits in $X$. For $i = 1, \\ldots, N$ in this order, do the following: insert the $i$\\-th character in the decimal notation of $X$ at the beginning or end of $S$.\n*   Let $Y$ be the positive integer represented by the string $S$.\n\nLet $f(X)$ denote the minimum positive integer that can be obtained from $X$ in this way.\n\n* * *\n\nYou are given a positive integer $Y$ none of whose digits is $0$. Print the number, modulo $998244353$, of positive integers $X$ none of whose digits is $0$ such that $f(X) = Y$."},{"iden":"constraints","content":"*   $Y$ is a positive integer none of whose digits is $0$.\n*   $1\\leq Y < 10^{200000}$"},{"iden":"input","content":"The input is given from Standard Input in the following format:\n\n$Y$"},{"iden":"sample input 1","content":"1332"},{"iden":"sample output 1","content":"3\n\nThree integers, $1332$, $3132$, and $3312$, satisfy the conditions."},{"iden":"sample input 2","content":"3312"},{"iden":"sample output 2","content":"0"},{"iden":"sample input 3","content":"12234433442"},{"iden":"sample output 3","content":"153"}],"translated_statement":null,"sample_group":[],"show_order":["default"],"formal_statement":null,"simple_statement":null,"has_page_source":true}