Intact Intervals

Gustav is an astronaut on the Nordic Celestial Planetary Craft (NCPC), a large space station in orbit around Mars. Today, one of Gustavâ€™s tasks is to look over the satefy routines on board.

The space station consists of $n$ modules arranged in a circle, so that module $i$ is connected to module $i+1$ for $i = 1 \ldots n-1$, and module $n$ is connected to module $1$. Each module $i$ has a non-negative integer type $a_ i$, representing the kind of equipment that can be found there. Different modules can have the same type. In case of emergency, the equipment must be rearranged so that each module $i$ instead gets type $b_ i$, for some list $b_1, b_2, \cdots , b_ n$. Here, the list $b$ is a rearrangement of the list $a$.

Gustav has noticed that if some module connections are severed, causing the space station to split into separate parts, it may become impossible to perform this rearrangement of the equipment. He decides to estimate how likely it is that the safety routines can be followed, by calculating in how many ways the space station can be separated into two or more parts such that it is still possible to rearrange the equipment according to the emergency procedures.

In other words, your task is to count in how many ways the
circular list $a$ can be
partitioned into *at least two* non-empty
contiguous intervals, in such a way that the circular list
$b$ can be obtained by
rearranging elements within each interval. Since this number
can be quite big, you should find its remainder modulo
$10^9+7$.

For example, consider Sample Input 1 below. Here the list $a$ could be split into $[1 | 2 2 3 | 4]$, indicating that the connection between modules $1$ and $2$, and the connection between modules $4$ and $5$, are severed. Note that the connection between module $5$ and $1$ remains in this split. The second possible way in which $a$ could be split is $[1 2 | 2 | 3 4]$.

In Sample Input 2 below, the only possible way to split the list $a$ into at least two non-empty parts is to separate the two modules. But then it is impossible to rearrange the parts to create the list $b$. Hence, the answer is $0$.

The first line of input contains a single integer $n$ ($2 \leq n \leq 10^6$), the number of modules. The second line contains the $n$ integers $a_1, \ldots a_ n$ ($0 \leq a_ i \leq 10^9$). The third and final line contains the $n$ integers $b_1, \ldots , b_ n$ ($0 \leq b_ i \leq 10^9$).

The list $b$ is guaranteed to be a rearrangement of the list $a$.

Print one integer, the number of safe separations modulo $10^9+7$.

Sample Input 1 | Sample Output 1 |
---|---|

5 1 2 2 3 4 4 3 2 2 1 |
2 |

Sample Input 2 | Sample Output 2 |
---|---|

2 1 2 2 1 |
0 |