{"problem":{"name":"Predilection","description":{"content":"Given is a sequence $A$ of length $N$. You can do this operation any number of times: when the length of the sequence is at least $2$, choose two adjacent values, delete them, and insert their sum whe","description_type":"Markdown"},"platform":"AtCoder","limit":{"time_limit":2000,"memory_limit":262144},"difficulty":"None","is_remote":true,"is_sync":true,"sync_url":null,"sign":"abc230_f"},"statements":[{"statement_type":"Markdown","content":"Given is a sequence $A$ of length $N$. You can do this operation any number of times: when the length of the sequence is at least $2$, choose two adjacent values, delete them, and insert their sum where they were. How many sequences can result from zero or more operations? Find the count modulo $998244353$.\n\n## Constraints\n\n*   $1 \\leq N \\leq 2\\times 10^5$\n*   $|A_i| \\leq 10^9$\n*   All values in input are integers.\n\n## Input\n\nInput is given from Standard Input in the following format:\n\n$N$\n$A_1$ $A_2$ $\\cdots$ $A_N$\n\n[samples]","is_translate":false,"language":"English"}],"meta":{"iden":"abc230_f","tags":[],"sample_group":[["3\n1 -1 1","4\n\nThe following four sequences can result from zero or more operations.\n\n*   ${1,-1,1}$\n*   ${1,0}$\n*   ${0,1}$\n*   ${1}$"],["10\n377914575 -275478149 0 -444175904 719654053 -254224494 -123690081 377914575 -254224494 -21253655","321"]],"created_at":"2026-03-03 11:01:13"}}