{"raw_statement":[{"iden":"problem statement","content":"A positive-integer sequence is said to be **splendid** if no two adjacent elements are equal.\nFind the sum, modulo $998244353$, of the lengths of all splendid sequences whose elements have a sum of $N$."},{"iden":"constraints","content":"*   $1 \\le N \\le 2 \\times 10^5$\n*   All values in the input are integers."},{"iden":"input","content":"The input is given from Standard Input in the following format:\n\n$N$"},{"iden":"sample input 1","content":"4"},{"iden":"sample output 1","content":"8\n\nThere are four splendid sequences whose sum is $4$: $(4),(1,3),(3,1),(1,2,1)$. Thus, the answer is the sum of their lengths: $1+2+2+3=8$.\n$(2,2)$ and $(1,1,2)$ also have a sum of $4$ but ineligible because their $1$\\-st and $2$\\-nd elements are the same."},{"iden":"sample input 2","content":"297"},{"iden":"sample output 2","content":"475867236"},{"iden":"sample input 3","content":"123456"},{"iden":"sample output 3","content":"771773807"}],"translated_statement":null,"sample_group":[],"show_order":["default"],"formal_statement":null,"simple_statement":null,"has_page_source":true}