Virtual contest is a way to take part in past contest, as close as possible to participation on time. It is supported only ICPC mode for virtual contests.
If you've seen these problems, a virtual contest is not for you - solve these problems in the archive.
If you just want to solve some problem from a contest, a virtual contest is not for you - solve this problem in the archive.
Never use someone else's code, read the tutorials or communicate with other person during a virtual contest.

combinatorics

data structures

greedy

sortings

*3300

No tag edit access

The problem statement has recently been changed. View the changes.

×
G. A Certain Magical Party

time limit per test

2 secondsmemory limit per test

256 megabytesinput

standard inputoutput

standard outputThere 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.

Input

The first line contains a single integer $$$n$$$ ($$$1 \leq n \leq 2 \cdot 10^5$$$) — the number of people.

The second line contains a sequence of $$$n$$$ integers $$$a_1,a_2,...,a_n$$$ ($$$1 \leq a_i \leq 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

Output the number of different valid speaking orders. Since this number can be large, output it modulo $$$998244353$$$.

Examples

Input

4 1 2 4 4 1 1 0 0

Output

2

Input

4 3 4 3 1 0 1 0 0

Output

0

Input

21 1 2 19 19 19 19 19 19 19 19 19 21 21 21 21 21 21 21 21 21 21 1 1 0 0 0 0 0 0 0 0 0 1 1 1 1 1 1 1 1 1 1

Output

49439766

Note

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 shows the current happiness values and results.

Step $$$1$$$: $$$[1,2,4,4]$$$ $$$\rightarrow$$$ Person $$$2$$$ tells the story to others. Since his kind of personality is $$$1$$$, his happiness increases by $$$2$$$ since persons $$$3$$$ and $$$4$$$ have strictly greater happiness.

Step $$$2$$$: $$$[1,4,4,4]$$$ $$$\rightarrow$$$ Person $$$1$$$ tells the story to others. Since his kind of personality is $$$1$$$, his happiness increases by $$$3$$$ since persons $$$2$$$, $$$3$$$ and $$$4$$$ have strictly greater happiness.

Step $$$3$$$: $$$[4,4,4,4]$$$ $$$\rightarrow$$$ Person $$$4$$$ tells the story to others. Since his kind of personality is $$$0$$$, his happiness increases by $$$0$$$ since no one has strictly lesser happiness.

Step $$$4$$$: $$$[4,4,4,4]$$$ $$$\rightarrow$$$ Person $$$3$$$ tells the story to others. Since his kind of personality is $$$0$$$, his happiness increases by $$$0$$$ since no one has strictly lesser happiness.

At the end, everyone has equal happiness.

Note that $$$[2,1,3,4]$$$ is also a valid answer for this example.

It can be shown that there is no valid ordering for the second example.

Codeforces (c) Copyright 2010-2024 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Apr/18/2024 10:32:19 (i1).

Desktop version, switch to mobile version.

Supported by

User lists

Name |
---|