{"raw_statement":[{"iden":"problem statement","content":"Find the number of pairs $(P,Q)=((P_1,P_2,\\cdots,P_N),(Q_1,Q_2,\\cdots,Q_N))$ of permutations of $(1,2,\\cdots,N)$ that satisfy the following condition, modulo $998244353$.\n\n*   For every $i$ ($1 \\leq i \\leq N-1$), one of the two conditions below holds.\n    *   $P_i < P_{i+1}$ and $Q_i < Q_{i+1}$.\n    *   $P_i > P_{i+1}$ and $Q_i > Q_{i+1}$."},{"iden":"constraints","content":"*   $2 \\leq N \\leq 2 \\times 10^5$\n*   All numbers 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":"2"},{"iden":"sample output 1","content":"2\n\nTwo pairs, $(P,Q)=((1,2),(1,2))$ and $(P,Q)=((2,1),(2,1))$, satisfy the condition."},{"iden":"sample input 2","content":"3"},{"iden":"sample output 2","content":"10"},{"iden":"sample input 3","content":"4"},{"iden":"sample output 3","content":"88"},{"iden":"sample input 4","content":"10"},{"iden":"sample output 4","content":"286574791"}],"translated_statement":null,"sample_group":[],"show_order":["default"],"formal_statement":null,"simple_statement":null,"has_page_source":true}