#P1237B. Balanced Tunnel

    ID: 2130 Type: RemoteJudge 1000ms 512MiB Tried: 0 Accepted: 0 Difficulty: (None) Uploaded By: Tags>data structuressortingstwo pointers*1300

Balanced Tunnel

No submission language available for this problem.

Description

Consider a tunnel on a one-way road. During a particular day, nn cars numbered from 11 to nn entered and exited the tunnel exactly once. All the cars passed through the tunnel at constant speeds.

A traffic enforcement camera is mounted at the tunnel entrance. Another traffic enforcement camera is mounted at the tunnel exit. Perfectly balanced.

Thanks to the cameras, the order in which the cars entered and exited the tunnel is known. No two cars entered or exited at the same time.

Traffic regulations prohibit overtaking inside the tunnel. If car ii overtakes any other car jj inside the tunnel, car ii must be fined. However, each car can be fined at most once.

Formally, let's say that car ii definitely overtook car jj if car ii entered the tunnel later than car jj and exited the tunnel earlier than car jj. Then, car ii must be fined if and only if it definitely overtook at least one other car.

Find the number of cars that must be fined.

The first line contains a single integer nn (2n1052 \le n \le 10^5), denoting the number of cars.

The second line contains nn integers a1,a2,,ana_1, a_2, \ldots, a_n (1ain1 \le a_i \le n), denoting the ids of cars in order of entering the tunnel. All aia_i are pairwise distinct.

The third line contains nn integers b1,b2,,bnb_1, b_2, \ldots, b_n (1bin1 \le b_i \le n), denoting the ids of cars in order of exiting the tunnel. All bib_i are pairwise distinct.

Output the number of cars to be fined.

Input

The first line contains a single integer nn (2n1052 \le n \le 10^5), denoting the number of cars.

The second line contains nn integers a1,a2,,ana_1, a_2, \ldots, a_n (1ain1 \le a_i \le n), denoting the ids of cars in order of entering the tunnel. All aia_i are pairwise distinct.

The third line contains nn integers b1,b2,,bnb_1, b_2, \ldots, b_n (1bin1 \le b_i \le n), denoting the ids of cars in order of exiting the tunnel. All bib_i are pairwise distinct.

Output

Output the number of cars to be fined.

Samples

Sample Input 1

5
3 5 2 1 4
4 3 2 5 1

Sample Output 1

2

Sample Input 2

7
5 2 3 6 7 1 4
2 3 6 7 1 4 5

Sample Output 2

6

Sample Input 3

2
1 2
1 2

Sample Output 3

0

Note

The first example is depicted below:

Car 22 definitely overtook car 55, while car 44 definitely overtook cars 11, 22, 33 and 55. Cars 22 and 44 must be fined.

In the second example car 55 was definitely overtaken by all other cars.

In the third example no car must be fined.