n = int(input())
lst_in = list(map(int,input().split()))
lst_out = list(map(int,input().split()))
i = 0
j = 0
s = set()
while j < n:
if lst_in[i] in s:
i+=1
elif lst_in[i] != lst_out[j]:
s.add(lst_out[j])
j+=1
else:
i+=1
j+=1
print(len(s))#include <bits/stdc++.h>
using namespace std;
#define N 100010
int n;
bool hasQualified[N];
queue<int> initialOrder, finalOrder;
int main() {
cin >> n;
for (int i = 1; i <= n; i++) {
int carNum;
cin >> carNum;
initialOrder.push(carNum);
}
for (int i = 1; i <= n; i++) {
int carNum;
cin >> carNum;
finalOrder.push(carNum);
}
int numQualified = 0;
while (finalOrder.size()) {
while (hasQualified[initialOrder.front()])
initialOrder.pop();
if (initialOrder.front() == finalOrder.front()) {
initialOrder.pop();
finalOrder.pop();
}
else {
hasQualified[finalOrder.front()] = true;
finalOrder.pop();
numQualified++;
}
}
cout << numQualified << endl;
return 0;
}
1006A - Adjacent Replacements | 1195C - Basketball Exercise |
1206A - Choose Two Numbers | 1438B - Valerii Against Everyone |
822A - I'm bored with life | 9A - Die Roll |
1430B - Barrels | 279B - Books |
1374B - Multiply by 2 divide by 6 | 1093B - Letters Rearranging |
1213C - Book Reading | 1468C - Berpizza |
1546B - AquaMoon and Stolen String | 1353C - Board Moves |
902A - Visiting a Friend | 299B - Ksusha the Squirrel |
1647D - Madoka and the Best School in Russia | 1208A - XORinacci |
1539B - Love Song | 22B - Bargaining Table |
1490B - Balanced Remainders | 264A - Escape from Stones |
1506A - Strange Table | 456A - Laptops |
855B - Marvolo Gaunt's Ring | 1454A - Special Permutation |
1359A - Berland Poker | 459A - Pashmak and Garden |
1327B - Princesses and Princes | 1450F - The Struggling Contestant |