{"raw_statement":[{"iden":"problem statement","content":"$N$ people called Person $1, 2, \\ldots, N$ are standing in a circle.\nFor each $1 \\leq i \\leq N-1$, Person $i$'s neighbor to the right is Person $i+1$, and Person $N$'s neighbor to the right is Person $1$.\nPerson $i$ initially has $a_i$ balls.\nThey will do the following procedure just once.\n\n*   Each person chooses some (possibly zero) of the balls they have.\n*   Then, each person **simultaneously** hands the chosen balls to the neighbor to the right.\n*   Now, make a sequence of length $N$, where the $i$\\-th term is the number of balls Person $i$ has at the moment.\n\nLet $S$ be the set of all sequences that can result from the procedure. For example, when $a=(1,1,1)$, we have $S= {(0,1,2),(0,2,1),(1,0,2),(1,1,1),(1,2,0),(2,0,1),(2,1,0) }$.\nCompute $\\sum_{x \\in S} \\prod_{i=1}^{N} x_i$, modulo $998244353$."},{"iden":"constraints","content":"*   All values in input are integers.\n*   $3 \\leq N \\leq 10^5$\n*   $0 \\leq a_i \\leq 10^9$"},{"iden":"input","content":"Input is given from Standard Input in the following format:\n\n$N$\n$a_{1}$ $a_{2}$ $\\cdots$ $a_{N}$"},{"iden":"sample input 1","content":"3\n1 1 1"},{"iden":"sample output 1","content":"1\n\n*   We have $S= {(0,1,2),(0,2,1),(1,0,2),(1,1,1),(1,2,0),(2,0,1),(2,1,0) }$.\n*   $\\sum_{x \\in S} \\prod_{i=1}^{N} x_i$ is $1$."},{"iden":"sample input 2","content":"3\n2 1 1"},{"iden":"sample output 2","content":"6"},{"iden":"sample input 3","content":"20\n5644 493 8410 8455 7843 9140 3812 2801 3725 6361 2307 1522 1177 844 654 6489 3875 3920 7832 5768"},{"iden":"sample output 3","content":"864609205\n\n*   Be sure to compute it modulo $998244353$."}],"translated_statement":null,"sample_group":[],"show_order":["default"],"formal_statement":null,"simple_statement":null,"has_page_source":true}