Permutation

题号：NC219808
时间限制：C/C++/Rust/Pascal 1秒，其他语言2秒
空间限制：C/C++/Rust/Pascal 512 M，其他语言1024 M
64bit IO Format: %lld

题目描述

You are given two permutations $a_{}$ and $b_{}$ of length $n_{}$ .
A permutation is a sequence of length $n_{}$ integers from $1_{}$ to $n_{}$ , in which all the numbers occur exactly once. For example, $[1], [1,3,2], [3,1,5,2,4]_{}$ are permutations, and $[2], [1,1]_{}$ are not.

There are two types of operations as follow：

Remove the first integer in $a_{}$ . Then append any integer at the end of $a_{}$ .
Choose an $a_i(1\leq i\leq n)$ and modify it to any integer.

You have to find the minimum number of operations to make $a_{}$ and $b_{}$ the same.
Be attention, you do not have to keep $a_{}$ in a permutation during the process.

输入描述:

The first line contains an integer  — the length of  and  .
The second line contains  integers  .
The third line contains  integers  .
It is guaranteed that  and  are both permutations.

输出描述:

Output the minimum number of operations to make  and  the same.

示例1

输入

复制

5
5 2 3 4 1
5 3 2 1 4

输出

复制

说明

For the first example, there is a possible way:
1. Remove the first integer in  and append 4, now  becomes .
2. modify  to , now  becomes .
3. modify  to , now  becomes .
So it only takes  operations to convert  into .