Photoshoot 2

문제

In what seems to be a familiar occurrence, Farmer John is lining up his $NN$ cows ($1\le N\le {10}^{5}1\backslash le\; N\backslash le\; 10^5$), conveniently numbered $1\dots N1\backslash ldots\; N$, for a photograph.

Initially, the cows are lined up in the order $a_1,a_2,\dots ,a_{N}a\_1,a\_2,\backslash ldots,a\_N$ from left to right. Farmer John's goal is to line up the cows in the order $b_1,\dots ,b_{N}b\_1,\backslash ldots,b\_N$ from left to right. To accomplish this, he may perform a series of modifications to the ordering. Each modification consists of choosing a single cow and moving it some number of positions to the left.

Please count the minimum number of modifications required in order for Farmer John to line up his cows in the desired order.

입력

The first line of input contains $NN$. The second line contains $a_1,a_2,\dots ,a_{N}a\_1,a\_2,\backslash ldots,a\_N$. The third line contains $b_1,b_2,\dots ,b_{N}b\_1,b\_2,\backslash ldots,b\_N$.

출력

Print the minimum number of modifications required to produce Farmer John's desired ordering.

5
1 2 3 4 5
1 2 3 4 5

0

5
5 1 3 2 4
4 5 2 1 3

2