B"There are n people at a party. The i -th person has an amount of happiness a_i . Every person has a certain kind of personality which can be represented as a binary integer b . If b = 0 , it means the happiness of the person will increase if he tells the story to someone strictly less happy than them. If b = 1 , it means the happiness of the person will increase if he tells the story to someone strictly more happy than them. Let us define a speaking order as an ordering of the people from left to right. Now the following process occurs. We go from left to right. The current person tells the story to all people other than himself. Note that all happiness values stay constant while this happens. After the person is done, he counts the number of people who currently have strictly less/more happiness than him as per his kind of personality, and his happiness increases by that value. Note that only the current person's happiness value increases. As the organizer of the party, you don't want anyone to leave sad. Therefore, you want to count the number of speaking orders such that at the end of the process all n people have equal happiness. Two speaking orders are considered different if there exists at least one person who does not have the same position in the two speaking orders. The first line contains a single integer n ( 1 <= q n <= q 2 cdot 10^5 ) -- the number of people. The second line contains a sequence of n integers a_1,a_2,...,a_n ( 1 <= q a_i <= q 2n ) -- the happiness values. The third line contains a sequence of n binary numbers b_1,b_2,...,b_n ( b_i in {0,1 } ) -- the kinds of personality. Output the number of different valid speaking orders. Since this number can be large, output it modulo 998244353 . Here is the explanation for the first example. One valid speaking order is [2,1,4,3] (here, we have written the indices of each person). Each step "...