{"raw_statement":[{"iden":"problem statement","content":"Given an integer $N$, solve the following problem.\nLet $f(x)=$ (The number of positive integers at most $x$ with the same number of digits as $x$).  \nFind $f(1)+f(2)+\\dots+f(N)$ modulo $998244353$."},{"iden":"constraints","content":"*   $N$ is an integer.\n*   $1 \\le N < 10^{18}$"},{"iden":"input","content":"Input is given from Standard Input in the following format:\n\n$N$"},{"iden":"sample input 1","content":"16"},{"iden":"sample output 1","content":"73\n\n*   For a positive integer $x$ between $1$ and $9$, the positive integers at most $x$ with the same number of digits as $x$ are $1,2,\\dots,x$.\n    *   Thus, we have $f(1)=1,f(2)=2,...,f(9)=9$.\n*   For a positive integer $x$ between $10$ and $16$, the positive integers at most $x$ with the same number of digits as $x$ are $10,11,\\dots,x$.\n    *   Thus, we have $f(10)=1,f(11)=2,...,f(16)=7$.\n\nThe final answer is $73$."},{"iden":"sample input 2","content":"238"},{"iden":"sample output 2","content":"13870"},{"iden":"sample input 3","content":"999999999999999999"},{"iden":"sample output 3","content":"762062362\n\nBe sure to find the sum modulo $998244353$."}],"translated_statement":null,"sample_group":[],"show_order":["default"],"formal_statement":null,"simple_statement":null,"has_page_source":true}