{"problem":{"name":"Same Descent Set","description":{"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$. *   For every $i$ ($1 \\leq i","description_type":"Markdown"},"platform":"AtCoder","limit":{"time_limit":6000,"memory_limit":262144},"difficulty":"None","is_remote":true,"is_sync":true,"sync_url":null,"sign":"agc060_d"},"statements":[{"statement_type":"Markdown","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}$.\n\n## Constraints\n\n*   $2 \\leq N \\leq 2 \\times 10^5$\n*   All numbers in the input are integers.\n\n## Input\n\nThe input is given from Standard Input in the following format:\n\n$N$\n\n[samples]","is_translate":false,"language":"English"}],"meta":{"iden":"agc060_d","tags":[],"sample_group":[["2","2\n\nTwo pairs, $(P,Q)=((1,2),(1,2))$ and $(P,Q)=((2,1),(2,1))$, satisfy the condition."],["3","10"],["4","88"],["10","286574791"]],"created_at":"2026-03-03 11:01:14"}}