{"raw_statement":[{"iden":"problem statement","content":"Given an integer $N$, find the number of integers $X$ that satisfy all of the following conditions, modulo $998244353$.\n\n*   $X$ is an $N$\\-digit positive integer.\n*   Let $X_1,X_2,\\dots,X_N$ be the digits of $X$ from top to bottom. They satisfy all of the following:\n    *   $1 \\le X_i \\le 9$ for all integers $1 \\le i \\le N$;\n    *   $|X_i-X_{i+1}| \\le 1$ for all integers $1 \\le i \\le N-1$."},{"iden":"constraints","content":"*   $N$ is an integer.\n*   $2 \\le N \\le 10^6$"},{"iden":"input","content":"Input is given from Standard Input in the following format:\n\n$N$"},{"iden":"sample input 1","content":"4"},{"iden":"sample output 1","content":"203\n\nSome of the $4$\\-digit integers satisfying the conditions are $1111,1234,7878,6545$."},{"iden":"sample input 2","content":"2"},{"iden":"sample output 2","content":"25"},{"iden":"sample input 3","content":"1000000"},{"iden":"sample output 3","content":"248860093\n\nBe sure to find the count modulo $998244353$."}],"translated_statement":null,"sample_group":[],"show_order":["default"],"formal_statement":null,"simple_statement":null,"has_page_source":true}