#abc276f. [abc276_f]Double Chance

[abc276_f]Double Chance

Problem Statement

There are NN cards called card 11, card 22, ldots\\ldots, card NN. On card ii (1leqileqN)(1\\leq i\\leq N), an integer AiA_i is written.

For K=1,2,ldots,NK=1, 2, \\ldots, N, solve the following problem.

We have a bag that contains KK cards: card 11, card 22, ldots\\ldots, card KK.
Let us perform the following operation twice, and let xx and yy be the numbers recorded, in the recorded order.

Draw a card from the bag uniformly at random, and record the number written on that card. Then, return the card to the bag.

Print the expected value of max(x,y)\\max(x,y), modulo 998244353998244353 (see Notes).
Here, max(x,y)\\max(x,y) denotes the value of the greater of xx and yy (or xx if they are equal).

Notes

It can be proved that the sought expected value is always finite and rational. Additionally, under the Constraints of this problem, when that value is represented as fracPQ\\frac{P}{Q} with two coprime integers PP and QQ, it can be proved that there is a unique integer RR such that RtimesQequivPpmod998244353R \\times Q \\equiv P\\pmod{998244353} and 0leqRlt9982443530 \\leq R \\lt 998244353. Print this RR.

Constraints

  • 1leqNleq2times1051 \\leq N \\leq 2\\times 10^5
  • 1leqAileq2times1051 \\leq A_i \\leq 2\\times 10^5
  • All values in the input are integers.

Input

The input is given from Standard Input in the following format:

NN A1A_1 A2A_2 ldots\\ldots ANA_N

Output

Print NN lines. The ii-th line (1leqileqN)(1\\leq i\\leq N) should contain the answer to the problem for K=iK=i.


Sample Input 1

3
5 7 5

Sample Output 1

5
499122183
443664163

For instance, the answer for K=2K=2 is found as follows.

The bag contains card 11 and card 22, with A1=5A_1=5 and A2=7A_2=7 written on them, respectively.

  • If you draw card 11 in the first draw and card 11 again in the second draw, we have x=y=5x=y=5, so max(x,y)=5\\max(x,y)=5.
  • If you draw card 11 in the first draw and card 22 in the second draw, we have x=5x=5 and y=7y=7, so max(x,y)=7\\max(x,y)=7.
  • If you draw card 22 in the first draw and card 11 in the second draw, we have x=7x=7 and y=5y=5, so max(x,y)=7\\max(x,y)=7.
  • If you draw card 22 in the first draw and card 22 again in the second draw, we have x=y=7x=y=7, so max(x,y)=7\\max(x,y)=7.

These events happen with the same probability, so the sought expected value is frac5+7+7+74=frac132\\frac{5+7+7+7}{4}=\\frac{13}{2}. We have 499122183times2equiv13pmod998244353499122183\\times 2\\equiv 13 \\pmod{998244353}, so 499122183499122183 should be printed.


Sample Input 2

7
22 75 26 45 72 81 47

Sample Output 2

22
249561150
110916092
873463862
279508479
360477194
529680742