Kanade has n boxes , the i-th box has p[i] probability to have an diamond of d[i] size.
At the beginning , Kanade has a diamond of 0 size. She will open the boxes from 1-st to n-th. When she open a box,if there is a diamond in it and it's bigger than the diamond of her , she will replace it with her diamond.
Now you need to calculate the expect number of replacements.
You only need to output the answer module 998244353.
Notice: If x%998244353=y*d %998244353 ,then we denote that x/y%998244353 =d%998244353
The first line has one integer n.
Then there are n lines. each line has two integers p[i]*100 and d[i].
Output the answer module 998244353
1<= n <= 100000
1<=p[i]*100 <=100
1<=d[i]<=10^9