문제

Farmer John has $N$ cows ($2 \leq N \leq 10^5$). Each cow has a breed that is either Guernsey or Holstein. As is often the case, the cows are standing in a line, numbered $1 \ldots N$ in this order.

Over the course of the day, each cow writes down a list of cows. Specifically, cow $i$'s list contains the range of cows starting with herself (cow $i$) up to and including cow $E_i$ ($i \leq E_i \leq N$).

FJ has recently discovered that each breed of cow has exactly one distinct leader. FJ does not know who the leaders are, but he knows that each leader must have a list that includes all the cows of their breed, or the other breed's leader (or both).

Help FJ count the number of pairs of cows that could be leaders. It is guaranteed that there is at least one possible pair.

입력

The first line contains $N$.

The second line contains a string of length $N$, with the $i$th character denoting the breed of the $i$th cow (G meaning Guernsey and H meaning Holstein). It is guaranteed that there is at least one Guernsey and one Holstein.

The third line contains $E_1 \dots E_N$.

출력

Output the number of possible pairs of leaders.

예제 입력 1

4
GHHG
2 4 3 4

예제 출력 1

1

예제 입력 2

3
GGH
2 3 3

예제 출력 2

2

점수

Inputs 3-5: $N \leq 100$Inputs 6-10: $N \leq 3000$Inputs 11-17: No additional constraints.