A factory assembly line is laid out as a single fixed sequence of n stations, each identified by a distinct integer ID, ordered from the first station a part visits to the last. Before each shift, the safety team publishes a list of station IDs that require inspection during that shift; every published ID is guaranteed to belong to some station on the line, and no ID is published twice. An inspection zone is a maximal run of consecutive stations along the line (in the fixed line order) that are all on the inspection list — a single un-flagged station anywhere breaks the run into two separate zones (or removes a would-be zone entirely if it stood alone).

Count how many separate inspection zones this shift's list creates.

Input format

• Line 1: a single integer n, the number of stations on the line.
• Line 2: n space-separated distinct integers, the station IDs in line order (first station to last).
• Line 3: a single integer m, the number of stations flagged for inspection this shift.
• Line 4: m space-separated distinct integers, the flagged station IDs (each one is guaranteed to appear somewhere on line 2). This line is empty when m is 0.

Output format

• A single integer: the number of inspection zones.

Constraints

• 1 <= n <= 2*10^5
• 0 <= m <= n
• -10^9 <= each station ID <= 10^9, and all n station IDs are distinct
• the m flagged IDs are distinct, and each one appears among the n station IDs

4
1 2 3 4
2
2 4

2

5
5 10 15 20 25
3
10 15 25

2