#include <iostream>
#include<bits/stdc++.h>
 
using namespace std;
 
int main() {
	// your code goes here
	int n;
	cin>>n;
	vector<int> arr1(n);
	vector<int> arr2(n);
	for(int i=0;i<n;i++){
		cin>>arr1[i];
	}
 
	unordered_map<int,int> mpp;
 
 
	for(int i=0;i<n;i++){
		cin>>arr2[i];
		mpp[arr2[i]]=i;
	}
 
	int i=0;
	int j=0;
	int ans=0;
	int mini = INT_MIN;
 
 
 
	while(i<n && j<n){
		int a = arr1[j];
		int b = mpp[a];
		if(b>mini){
			mini=b;
			ans=max(ans,j-i+1);
			j++;
		}
		else{
			i=j;
			mini=INT_MIN;
		}
 
	}
 
	cout<<n-ans<<endl;
 
 
 
	return 0;
}

I2luY2x1ZGUgPGlvc3RyZWFtPgojaW5jbHVkZTxiaXRzL3N0ZGMrKy5oPgoKdXNpbmcgbmFtZXNwYWNlIHN0ZDsKCmludCBtYWluKCkgewoJLy8geW91ciBjb2RlIGdvZXMgaGVyZQoJaW50IG47CgljaW4+Pm47Cgl2ZWN0b3I8aW50PiBhcnIxKG4pOwoJdmVjdG9yPGludD4gYXJyMihuKTsKCWZvcihpbnQgaT0wO2k8bjtpKyspewoJCWNpbj4+YXJyMVtpXTsKCX0KCQoJdW5vcmRlcmVkX21hcDxpbnQsaW50PiBtcHA7CgkKCQoJZm9yKGludCBpPTA7aTxuO2krKyl7CgkJY2luPj5hcnIyW2ldOwoJCW1wcFthcnIyW2ldXT1pOwoJfQoJCglpbnQgaT0wOwoJaW50IGo9MDsKCWludCBhbnM9MDsKCWludCBtaW5pID0gSU5UX01JTjsKCQoJCgkKCXdoaWxlKGk8biAmJiBqPG4pewoJCWludCBhID0gYXJyMVtqXTsKCQlpbnQgYiA9IG1wcFthXTsKCQlpZihiPm1pbmkpewoJCQltaW5pPWI7CgkJCWFucz1tYXgoYW5zLGotaSsxKTsKCQkJaisrOwoJCX0KCQllbHNlewoJCQlpPWo7CgkJCW1pbmk9SU5UX01JTjsKCQl9CgkJCgl9CgkKCWNvdXQ8PG4tYW5zPDxlbmRsOwoJCgkKCQoJcmV0dXJuIDA7Cn0=

Ngo0IDIgMyAxIDUgNiAKMyAxIDQgNiA1IDIg

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