The first line of input contains N. The second line contains a1,a2,…,aN. The third line contains b1,b2,…,bN.

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

In first example, the cows are already in the desired order, so no modifications are required.

In second example, two modifications suffice. Here is one way Farmer John can rearrange his cows:

    Choose cow 4 and move it four positions to the left.
    Choose cow 2 and move it two positions to the left.

    5 1 3 2 4
-> 4 5 1 3 2
-> 4 5 2 1 3

USACO 2022 February Contest, Bronze