B'Pak Chanek comes up with an idea in the midst of boredom to play a game. The game is a rock tower game. There is a big rock that is used as a base. There are also N small identical rocks that Pak Chanek will use to build a rock tower with a height of N above the base rock. Initially, there are no small rocks that are located above the base rock. In other words, the height of the tower above the base rock is initially 0 . In one move, Pak Chanek can place one small rock onto the top of the tower which makes the height of the tower above the base rock increase by 1 . Each time Pak Chanek place one small rock, the following will happen after the small rock is placed: If the tower successfully reaches a height of N without any rocks falling after that, then the game is ended. If given an integer array [P_1, P_2, ldots, P_N] , what is the expected value of the number of moves that Pak Chanek needs to do to end the game? It can be proven that the expected value can be represented as an simple fraction frac{P}{Q} where Q is coprime to 998 ,244 ,353 . Output the value of P x Q^{-1} modulo 998 ,244 ,353 . The first line contains a single integer N ( 1 <= q N <= q 2 cdot10^5 ) -- the required height of the rock tower. The second line contains N integers P_1, P_2, P_3, ldots, P_N ( 0 <= q P_i <= q 99 ). An integer representing the expected value of the number of moves that Pak Chanek needs to do to end the game, modulo 998 ,244 ,353 . In the first example, the expected value of the number of moves that Pak Chanek needs to do to end the game is frac{19}{2} . '...