CSES - Aalto Competitive Programming 2024 - wk11 - Wed - Perfect run
  • Time limit: 1.00 s
  • Memory limit: 512 MB

Maija is speedrunning Minecraft. There are nn items numbered 1,2,,n1,2,\dots,n that she needs to get before she can defeat the ender dragon. Getting each of these items would theoretically only take one second if she tampered with the game's random probabilities but she would never do such a thing!

Instead she is going to save the game before trying to get each of the nn items and reloads it using some self made "specialized software" if she fails to get the item. Failing to get an item and reloading the game takes 5 seconds in total and the success rate of getting item ii is pip_i percent. She is then going to edit the run to look seamless afterwards. Find the expected number of seconds it takes Maija to finish the run in real time

Input

The first line contains a single integer nn. The second line contains nn integer p1,p2,,pnp_1,\,p_2,\dots,\,p_n.

Output

Print the expected number of seconds it will take to finish the run in real time modulo 998244353998244353.

Constraints

  • 1n1051 \leq n \leq 10^5
  • 1pi1001 \leq p_i \leq 100
  • All input values are integers.

Example 1

Input:

2
50 50

Output:

12

Example 2

Input:

1
1

Output:

496

Example 3

Input:

10
2 37 51 50 50 1 14 32 15 2

Output:

477575500